#include <bits/stdc++.h>

using namespace std;

const int len = 100005;
int n, m, x, y;
bool check[len];
vector<int> g[len];
vector<int> sol;

void dfs(int node) {
    check[node] = true;
    for (auto it : g[node])
        if (!check[it])
            dfs(it);
    sol.push_back(node);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        cin >> x >> y;
        g[x].push_back(y);
    }

    for (int i = 1; i <= n; i++)
        if (!check[i])
            dfs(i);

    reverse(sol.begin(), sol.end());
    for (int it : sol)
        cout << it << " ";
}