#include <bits/stdc++.h>
#define pb push_back
#define MAX 50005

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int main()
{
    vector < int > v[MAX];
    queue < int > q;
    int n, m, i, x, y, grad[MAX] = {};

    fin >> n >> m;
    for(i = 1; i <= m; i++)
    {
        fin >> x >> y;
        v[x].pb(y);
        grad[y]++;
    }

    for(i = 1; i <= n; i++) if(grad[i] == 0) q.push(i);
    while(q.empty() == 0)
    {
        x = q.front(), q.pop();
        fout << x << ' ';
        for(int vecin:v[x])
        {
            grad[vecin]--;
            if(grad[vecin] == 0) q.push(vecin);
        }
    }

    return 0;
}