#include <bits/stdc++.h>

using namespace std;
int f[50005];
queue <int> q;
vector<vector<int>> adj;
int main()
{
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    int n, m, a, b;
    cin >> n >> m;
    adj.resize(n + 1);
    for(int i = 0; i < m; i++){
        cin >> a >> b;
        f[b]++;
        adj[a].push_back(b);
    }
    for(int i = 1; i <= n; i++){
        if(f[i] == 0){
            q.push(i);
            cout << i << " ";
        }
    }
    while(!q.empty()){
        a = q.front();
        q.pop();
        for(int i = 0; i < adj[a].size(); i++){
            f[adj[a][i]]--;
            if(f[adj[a][i]] == 0){
                q.push(adj[a][i]);
                cout << adj[a][i] << " ";
            }
        }
    }
    return 0;
}