#include <bits/stdc++.h>

using namespace std;

vector<int> adj[50005];
int indeg[50005];

int main(){
    
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= m; i++){
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        indeg[b]++;
    }
    queue<int> q;
    vector<int> ans;
    for(int i = 1; i <= n; i++){
        if(!indeg[i]) q.push(i);
    }
    while(!q.empty()){
        int node = q.front();
        q.pop();
        ans.push_back(node);
        for(auto i : adj[node]){
            indeg[i]--;
            if(!indeg[i]) q.push(i);
        }
    }
    for(auto a : ans) cout << a << " ";
    return 0;
}