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