#include <bits/stdc++.h>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

void dfs(int node, const vector <vector <int>>& edges, vector <bool>& vis, vector <int>& topologic) {
    vis[node] = true;

    for (auto it : edges[node]) {
        if (!vis[it]) {
            dfs(it, edges, vis, topologic);
        }
    }

    topologic.push_back(node);
}

int main()
{
    int n, m;
    fin >> n >> m;

    vector <vector <int>> edges(n + 1);
    for (int i =  1; i <= m; i++) {
        int a, b;
        fin >> a >> b;
        edges[a].push_back(b);
    }

    vector <bool> vis(n + 1);
    vector <int> topologic;
    for (int i = 1; i <= n; i++) {
        if (!vis[i]) dfs(i, edges, vis, topologic);
    }

    reverse(topologic.begin(), topologic.end());
    for (auto it : topologic) {
        fout << it << ' ';
    }
    return 0;
}