#include <bits/stdc++.h>

using namespace std;

const int N_MAX = 50005;

int n, m;

vector < int > G[N_MAX];
vector < int > ans;

bool viz[N_MAX];

void DFS(int u) {
    viz[u] = true;
    for (auto v : G[u]) {
        if (viz[v] == 0) {
            DFS(v);
        }
    }
    ans.push_back(u);
}

int main() {
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int u, v;
        cin >> u >> v;
        G[u].push_back(v);
    }
    DFS(1);
    for (int i = 1; i <= n; ++i) {
        if (viz[i] == 0) {
            DFS(i);
        }
    }
    reverse(ans.begin(), ans.end());
    for (auto node : ans) {
        cout << node << " ";
    }
    return 0;
}