#include <bits/stdc++.h>
using namespace std;
#define dim 50005
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,x,y,grad[dim],i;
deque<int> q;
vector <int> L[dim];
int main(){
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y;
        grad[y]++;
        L[x].push_back(y);
    }
    for(i=1;i<=n;i++){
        if(grad[i]==0)
            q.push_back(i);
    }
    while(q.size()){
        int nod=q.front();
        q.pop_front();
        fout<<nod<<" ";
        for(auto it:L[nod]){
            grad[it]--;
            if(grad[it]==0){
                q.push_back(it);
            }
        }

    }

}