#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
queue<int>q;
vector<vector<int>>gr;
vector<int>grad_int;
vector<bool>folosit;
void sortare_topologica(int nod,vector<int>&rasp){
    folosit[nod]=false;
    q.push(nod);
    rasp.push_back(nod);
    while(!q.empty()){
        int nod_curent=q.front();
        q.pop();
        for(auto&x:gr[nod_curent]){
            grad_int[x]--;
            if(grad_int[x]==0){
                folosit[x]=false;
                rasp.push_back(x);
                q.push(x);
            }
        }
    }

}
int main(){
    int n,m;
    cin>>n>>m;
    gr.resize(n+1);
    grad_int.resize(n+1);
    folosit.resize(n+1,true);
    int a,b;
    for(int i=1;i<=m;i++){
        cin>>a>>b;
        gr[a].push_back(b);
        grad_int[b]+=1;
    }
    vector<int>rasp;
    for(int i=1;i<=n;i++){
        if(grad_int[i]==0 && folosit[i]){
            sortare_topologica(i,rasp);
        }
    }
    for(auto&x:rasp){
        cout<<x<<" ";
    }
}