#include <bits/stdc++.h>
#define cin fin
#define cout fout
using namespace std;
ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");
int n,m,i,cnt,a,b,k,grad[50004],sol[50004];
vector<int>G[50004];
queue<int>Q;
int main()
{
    cin>>n>>m;
    for(i=1;i<=m;i++)
    {
        cin>>a>>b;
        G[a].push_back(b);
        grad[b]++;
    }
    for(i=1;i<=n;i++)
        if(grad[i]==0)
            Q.push(i);
    while(!Q.empty())
    {
        k=Q.front();
        Q.pop();
        sol[++cnt]=k;
        for(auto i:G[k])
        {
            grad[i]--;
            if(grad[i]==0)
                Q.push(i);
        }
    }
    for(i=1;i<=n;i++)
    {
        cout<<sol[i]<<" ";
    }
    return 0;
}