#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
#define nmax 50003
int n,m,x,y;
bool viz[nmax];
vector < int > v[nmax];
vector < int > solutie;
void DFS(int nod)
{
    viz[nod]=1;
    for(vector < int >::iterator it=v[nod].begin(); it!=v[nod].end(); it++)
        if(!viz[*it]) DFS(*it);
    solutie.push_back(nod);
}
int main()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
        if(!viz[i]) DFS(i);
    for(vector < int >::iterator it= solutie.end()-1; it!= solutie.begin()-1; it--)
        g<<*it<<" ";
    return 0;
}