#include <bits/stdc++.h>

using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int n,m;
int x,y;
vector<int> v[50005];
queue<int> q;
int g[50005];
void bfs()
{
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        out<<x<<" ";
        for(auto it:v[x])
        {
            g[it]--;
            if(g[it]==0) q.push(it);
        }
    }
}
int main()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y;
        v[x].push_back(y);
        g[y]++;
    }
    for(int i=1;i<=n;i++)
        if(g[i]==0) q.push(i);
    bfs();
    return 0;
}