#include <bits/stdc++.h>

using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
set<int>suc[300000];
int n,m,x,y,i;
int nrpr[300001];
queue<int>q;
int main()
{
    in>>n>>m;
    for(i=1;i<=m;i++){
        in>>x>>y;
        suc[x].insert(y);
        nrpr[y]++;
    }
    for(i=1;i<=n;i++){
        if(nrpr[i]==0) q.push(i);
    }
    while(!q.empty()){
        x=q.front();
        q.pop();
        out<<x<<" ";
        for(auto k:suc[x]){
            nrpr[k]--;
            if(nrpr[k]==0) q.push(k);
        }
    }
    return 0;
}