#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
int n,m,i,x,y,nod,vecin,gr[50001];
vector <int> v[50001];
queue <int> q;
int main ()
{
    fin>>n>>m;
    for (i=1; i<=m; i++)
    {
        fin>>x>>y;
        v[x].push_back (y);
        gr[y]++;
    }
    for (i=1; i<=n; i++)
    {
        if (gr[i]==0)
            q.push (i);
    }
    while (!q.empty ())
    {
        nod=q.front ();
        fout<<nod<<" ";
        q.pop ();
        for (i=0; i<v[nod].size (); i++)
        {
            vecin=v[nod][i];
            gr[vecin]--;
            if (gr[vecin]==0)
                q.push (vecin);
        }
    }
    return 0;
}