#include <bits/stdc++.h>
using namespace std;

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

    int n, m;
    fin >> n >> m;
    vector<vector<int>> adj(n + 1);
    vector<int> in_degree(n + 1);
    for (int i = 1, x, y; i <= m; ++i) {
        fin >> x >> y;
        adj[x].push_back(y);
        ++in_degree[y];
    }

    queue<int> q;
    for (int i = 1; i <= n; ++i) {
        if (!in_degree[i]) {
            q.push(i);
        }
    }

    while (!q.empty()) {
        int nod = q.front(); q.pop();
        fout << nod << ' ';
        for (int vec : adj[nod]) {
            --in_degree[vec];
            if (!in_degree[vec]) {
                q.push(vec);
            }
        }
    }
    fout << '\n';

    return 0;
}