#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> v[50010];
queue <int> q;
int nr[50010],N,M,p;
int main()
{
    int i,j,x,y;
   fin>>N>>M;
   for(i=1;i<=M;i++)
   {
       fin>>x>>y;
       v[x].push_back(y);
       nr[y]++;
   }
   for(i=1;i<=N;i++)
   {
       if(nr[i]==0)
        q.push(i);
   }
   while(!q.empty())
   {
       p=q.front();
       q.pop();
       fout<<p<<" ";
       for(auto it:v[p])
       {
           nr[it]--;
           if(nr[it]==0)
            q.push(it);
       }
   }
}