#include <bits/stdc++.h>

using namespace std;

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

vector <int> v[50001];

queue <int>  q;

int n, m, di[50001], p, x, y;

int main()
{
    fin >> n >> m;

    for (int i = 1; i <= m; ++i){
        fin >> x >> y;
        v[x].push_back(y);
        di[y]++;
    }

    for (int i = 1; i <= n; ++i){
        if (di[i] == 0)
            q.push(i);
    }

    while (!q.empty()){
        p = q.front();
        q.pop();
        fout << p << " ";
        for (auto it : v[p]){
            di[it]--;
            if (di[it] == 0)
                q.push(it);
        }
    }
    return 0;
}