#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int n,m,x,y,grad[100005];
vector<int>v[100005];
queue<int>q;
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    for(int i=1;i<=m;++i)
    {
        cin>>x>>y;
        v[x].push_back(y);
        grad[y]++;
    }
    for(int i=1;i<=n;++i){
        if(grad[i]==0) q.push(i);
    }
    while(!q.empty()){
        cout<<q.front()<<' ';
        x=q.front();
        q.pop();
        for(auto it: v[x]){
            if(grad[it]>0){
                grad[it]--;
                if(grad[it]==0) q.push(it);
            }
        }
    }
    return 0;
}