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

using namespace std;

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

vector<int>a[50005];
queue<int>q;

int n,m,x,y,fr[50005];

int main()
{
    cin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        cin>>x>>y;
        a[x].push_back(y);
        fr[y]++;
    }
    for(int i=1; i<=n; i++)
        if(fr[i]==0)
        q.push(i);
    while(!q.empty())
    {
        int k=q.front();
        cout<<k<<" ";
        for(auto i:a[k])
        {
            fr[i]--;
            if(fr[i]==0)
                q.push(i);
        }
        q.pop();
    }
}