#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

vector <int> adj[50005];
int f[50005];
queue <int> q;

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