#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

    int n, m;
    fin >> n >> m;

    vector<vector<int>> g(n+1);
    vector<int> indegree(n+1, 0);

    for (int i = 0; i < m; i++) {
        int x, y;
        fin >> x >> y;
        g[x].push_back(y);
        ++indegree[y];
    }

    queue<int> q;
    vector<int> l;

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

    while (!q.empty()) {
        int node = q.front();
        q.pop();

        l.push_back(node);        
        for (int i = 0; i < g[node].size(); i++) {
            --indegree[g[node][i]];

            if (indegree[g[node][i]] == 0) {
                q.push(g[node][i]);
            }
        }
    }

    for (int n : l) {
        fout << n << " ";
        cout << n << " "; 
    }

    fout.close();
    return 0;
}