///sortaret
#include <bits/stdc++.h>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int i,j,n,m,x,y,f[50010],p;
vector <int> v[50010];
queue <int> q;
int main()
{
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
        f[y]++;
    }
    for(i=1; i<=n; i++)
        if(f[i]==0)
            q.push(i);

    while(q.size())
    {
        p=q.front();
        q.pop();
        fout<<p<<" ";
        for(auto it : v[p])
        {
            f[it]--;
            if(f[it]==0)
                q.push(it);
        }
    }
    return 0;
}