#include<fstream>
#include<vector>
#define max 1000001
using namespace std;

int n,m,k;
vector <int> a[max];
int coada[max],viz[max];

void dfs(int start)
{
   viz[start]=1;
  for (int i=0;i<a[start].size();i++)
    if (!viz[a[start][i]])
    {
        coada[k++]=a[start][i];
        dfs(a[start][i]);
    }

}

int main()
{
    int i,x,y;
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    f>>n>>m;
    for (i=0;i<m;i++)
    {
        f>>x>>y;
        a[x].push_back(y);
    }
    for (i=1;i<=n;i++)
    if (!viz[i]) {

      dfs(i);
      }
   for(i=0;i<k;i++)
        g<<coada[i]<<" ";
    f.close();
    g.close();
    return 0;
}