#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> v[50010];
queue <int> q;
int n,m,i,x,y,d[50010],nod;
int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
        d[y]++;
    }
    for(i=1;i<=n;i++)
        if(d[i]==0)
            q.push(i);
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        fout<<nod<<" ";
        for(auto it: v[nod])
        {
            d[it]--;
            if(d[it]==0)
                q.push(it);
        }
    }
    return 0;
}