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

using namespace std;

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

int n,m,i,u,v,gr[50005];
vector<int>g[50005];
queue<int>q;

int main()
{
    cin>>n>>m;
    for(i=1;i<=m;i++)
    {
        cin>>u>>v;
        g[u].push_back(v);
        gr[v]++;
    }
    for(i=1;i<=n;i++)
        if(gr[i]==0)
        q.push(i);
    while(!q.empty())
    {
        int curr=q.front();
        cout<<curr<<' ';
        q.pop();
        for(auto vec:g[curr])
        {
            gr[vec]--;
            if(gr[vec]==0)
                q.push(vec);
        }
    }
    return 0;
}