#include <bits/stdc++.h>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,grad[50005];
vector<int> lista[50005];
queue<int> q;
void citire(){
    fin>>n>>m;
    for(int i=1;i<=m;i++){
        int x,y;
        fin>>x>>y;
        lista[x].push_back(y);
        grad[y]++;
    }
    for(int i=1;i<=n;i++)
        if(grad[i]==0)
            q.push(i);
}
int viz[50005];
vector<int> sol;
void bfs(){
    while(!q.empty()){
        int x=q.front();
        sol.push_back(x);
        q.pop();
        for(auto el:lista[x]){
                grad[el]--;
                if(grad[el]==0)
                    q.push(el);
        }
    }
}

int main()
{
    citire();
    bfs();
    for(auto el:sol)
        fout<<el<<" ";
    return 0;
}