#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
#define MAX  50500
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector <int> v[MAX];
vector <int> ::iterator it;
queue <int> Q;
int deg[MAX];
int main()
{  int n,m,i,x,y,j,nod;
in>>n>>m;
for(i=1;i<=m;i++)
{   in>>x>>y;
v[x].push_back(y);
deg[y]++;
}
   for(i=1;i<=n;i++)
   {
    if(deg[i]==0)Q.push(i);
    while(!Q.empty())
    {
        nod=Q.front();
        Q.pop();
        for(it=v[nod].begin();it!=v[nod].end();++it)
        {  deg[*it]--;
            if(deg[*it])Q.push(*it);
        }
        out<<nod<<" ";
    }
}
    return 0;
}