#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");

int n,m,u,v,a[2005][2005],grad[50005],ans[2005],nr;
vector<int>g[50005];
queue<int>q;

int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>u>>v;
        g[u].push_back(v);
        grad[v]++;
    }
    for(int i=1;i<=n;i++)
        if(grad[i]==0)
        q.push(i);

    while(!q.empty())
    {
        int curr=q.front();
        q.pop();
        cout<<curr<<' ';
        for(auto x:g[curr])
        {
            grad[x]--;
            if(grad[x]==0)
                q.push(x);
        }
    }
    return 0;
}