#include<bits/stdc++.h>

using namespace std;

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

int n, m;
int grad[50005];
vector<int> g[50005];

int main(){
    in>>n>>m;
    for(int i=1; i<=m; i++){
        int x, y;
        in>>x>>y;
        g[x].push_back(y);
        grad[y]++;
    }
    //priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    queue<int> q;
    for(int i=1; i<=n; i++){
        if(grad[i]==0){
            q.push(i);
        }
    }
    while(!q.empty()){
        int nod=q.front();
        out<<nod<<" ";
        q.pop();
        for(int el:g[nod]){
            grad[el]--;
            if(grad[el]==0){
                //cout<<nod<<" "<<el<<'\n';
                q.push(el);
            }
        }
    }
    out<<'\n';
    return 0;
}