#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
vector <int> v[50001];
int coada[50001],deg[50001];
int main()
{
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    int n,m,a,b,i;
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>a>>b;
        v[a].push_back(b);
        deg[b]++;
    }
    int p=0,u=-1;
    for(i=1; i<=n; i++)
        if(deg[i]==0)///nod liber de griji
            coada[++u]=i;
    while(p<=u)
    {
        int x=coada[p++];
        for(auto it:v[x])
        {
            deg[it]--;
            if(deg[it]==0)
                coada[++u]=it;
        }
    }
    for(i=0; i<n; i++)
        cout<<coada[i]<<" ";
    return 0;
}