#include <bits/stdc++.h>

using namespace std;

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

int n, m;
vector<int> g[50005];
vector<int> ans;
bitset<50005> used;

void dfs(int node) {
    used[node] = true;
    for(auto nxt : g[node]) {
        if(!used[nxt])
            dfs(nxt);
    }
    ans.push_back(node);
}

int main() {
    in >> n >> m;
    for(int i = 1; i <= m; i++) {
        int u, v; in >> u >> v;
        g[u].push_back(v);
    }
    for(int i = 1; i <= n; i++) {
        if(!used[i])
            dfs(i);
    }
    reverse(ans.begin(), ans.end());
    for(auto elem : ans)
        out << elem << ' ';
    out << '\n';
    return 0;
}