#include <iostream>
#include <queue>
#include <fstream>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int grad[100001];
vector <int> a[100001];
int viz[100001];

int main()
{
 int n,m,i,j,x,y,k;

 fin>>n>>m;
 for(i=1;i<=m;i++)
    {
     fin>>x>>y;
     a[x].push_back(y);
     grad[y]++;
    }

 for(i=1;i<=n;i++)
  for(j=1;j<=n;j++)
 {
  if(viz[j]==0 && grad[j]==0)
  {
   viz[j]=1;
   fout<<j<<" ";
   for(k=0;k<a[j].size();k++)
        grad[a[j][k]]--;


  }

 }

    return 0;
}