#include <bits/stdc++.h>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector<vector<int>> adj;
vector<int> fr;
stack<int> l;
void dfs(int nod) {
    fr[nod] = 1;
    for (int j : adj[nod]) {
        if (fr[j] == 0) {
            dfs(j);
        }
    }
    l.push(nod);
}
int main() {
    int n, m;
    in >> n >> m;
    adj.resize(n + 1);
    fr.resize(n + 1);
    for (int i = 1; i <= m; i++) {
        int x, y;
        in >> x >> y;
        adj[x].push_back(y);
    }
    for (int i = 1; i <= n; i++) {
        if (fr[i] == 0) {
            dfs(i);
        }
    }
    while (!l.empty()) {
        out << l.top() << ' ';
        l.pop();
    }

    return 0;
}