#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,i,j,ext[50001],x,y,a[50001],k,nod;
vector <int> G[50001];
int main()
{f>>n>>m;
for(i=1; i<=m; i++)
{
    f>>x>>y;
    G[x].push_back(y);
    ext[y]++;
}
for(i=1; i<=n; i++)
    if(ext[i]==0)
        a[++k]=i;
for(i=1; i<=n; i++)
{
    nod=a[i];
    for(j=0; j<G[nod].size(); j++)
        {ext[G[nod][j]]--;
        if(ext[G[nod][j]]==0)
            a[++k]=G[nod][j];}
}

   for(i=1; i<=n; i++)
        g<<a[i]<<" ";
    return 0;
}