#include <bits/stdc++.h>

using namespace std;

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

int main()
{
    int n, m;
    fin >> n >> m;
    vector<vector<int>> adj(n + 1);
    vector<int> grade_in(n + 1, 0);
    for (int i = 0; i < m; i++) {
        int u, v;
        fin >> u >> v;
        adj[u].push_back(v);
        grade_in[v]++;
    }
    vector<int> rez;
    queue<int> q;
    for (int i = 1; i <= n; i++)
        if (grade_in[i] == 0)
            q.push(i);

    while (!q.empty()) {
        int current = q.front();
        q.pop();
        rez.push_back(current);
        for (int neigh : adj[current]) {
            grade_in[neigh]--;
            if (grade_in[neigh] == 0)
                q.push(neigh);
        }
    }
    for (int i = 0; i < rez.size(); i++)
        fout << rez[i] << " ";
    return 0;
}