#include <bits/stdc++.h>
#include <fstream>

using namespace std;

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

int n, m;
vector<int> res;

void dfs(vector<vector<int>> & adj, vector<bool> &viz, int node) {
    viz[node] = true;
    for (auto neigh : adj[node]) {
        if (!viz[neigh])
            dfs(adj, viz, neigh);
    }

    // cout << node << '\n';

    res.push_back(node);
}

int main() {
    in >> n >> m;
    vector<vector<int>> adj(n + 1, vector<int>());
    vector<bool> viz(n + 1, 0);
    

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

    for (int i = 1; i <= n; i++) {
        if (!viz[i])
            dfs(adj, viz, i);
    }

    for (int i = n - 1; i >= 0; i--) {
        out << res[i] << '\n';
    }
}