#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
 vector <int> v[50005];
 queue <int> q;
 int n,m,gr[50005];
 void Solve()
 { int i,x;

   while(!q.empty())
   { x=q.front(); q.pop();
      g<<x<<" ";
      for(i=0;i<v[x].size();i++)
      {gr[v[x][i]]--;
       if (!gr[v[x][i]]) q.push(v[x][i]);
      }
   }

 }
int main()
{ int i,x,y;
  f>>n>>m;
  for(i=1;i<=m;i++)
  { f>>x>>y; gr[y]++;
     v[x].push_back(y);
  }

  for(i=1;i<=n;i++)
   if (!gr[i]) q.push(i);

   Solve();
    return 0;
}