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

int n, m;
vector<int> v[50001];
stack<int> s;
bool ap[50001];

void dfs(int node) {
    ap[node] = 1;
    for (auto i : v[node]) {
        if (!ap[i]) {
            dfs(i);
        }
    }
    s.push(node);
}

int main() {
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int x, y;
        cin >> x >> y;
        v[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i) {
        if (!ap[i]) {
            dfs(i);
        }
    }
    while (!s.empty()) {
        cout << s.top() << " ";
        s.pop();
    }
}