#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int n,m,a[50001],ext[50001],i,j,x,y,nod;
vector <int> G[50001];
int main()
{freopen("sortaret.in", "r", stdin);
freopen("sortaret.out", "w", stdout);
scanf("%d%d", &n, &m);
for(i=1; i<=m; i++)
    {scanf("%d%d", &x, &y);
    G[x].push_back(y);
    ext[y]++;}
for(i=1; i<=n; i++)
    if(ext[i]==0)
        a[++a[0]]=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[++a[0]]=G[nod][j];
    }
}
    for(i=1; i<=n; i++)
        printf("%d ", a[i]);

    return 0;
}