#include <bits/stdc++.h>

using namespace std;

vector <int> v[50055];

int in[50055];

deque <int> q;

int main()
{
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    int n,m,x,y;
    cin>>n>>m;
    for(int i=1;i<=m;++i)
    {
        cin>>x>>y;
        v[x].push_back(y);
        in[y]++;
    }
    for(int i=1;i<=n;++i)
    {
        if(in[i]==0)
        {
            q.push_back(i);
        }
    }
    while(q.size())
    {
        cout<<q.front()<<" ";
        for(auto a:v[q.front()])
        {
            in[a]--;
            if(in[a]==0)
            {
                q.push_back(a);
            }
        }
        q.pop_front();
    }
    return 0;
}