#include <bits/stdc++.h>

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n, m, grad[50005];
vector <int> G[50005];
queue <int> q;

int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        f >> x >> y;
        G[x].push_back(y);
        grad[y]++;
    }
    for(int i = 1; i <= n; i++)
        if(grad[i] == 0)
            q.push(i);
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        g << nod << ' ';
        for(int vecin : G[nod])
        {
            grad[vecin]--;
            if(grad[vecin] == 0)
                q.push(vecin);
        }
    }
    return 0;
}