#include <iostream>
#include <queue>
#include <vector>
#include <fstream>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector <int> a[50001];
int nrp[50001];
int main(){
    queue<int>q;
    int n,m;
    in>>n>>m;
    for(int i=0; i<m; i++){
        int x,y;
        in>>x>>y;
        a[x].push_back(y);
        nrp[y]++;
    }
    for(int i=1;i<=n;i++){
        if(nrp[i]==0)
            q.push(i);
    }
    while(!q.empty()){
        int x=q.front();
        q.pop();
        for(auto y:a[x]){
            nrp[y]--;
            if(nrp[y]==0){
                q.push(y);
            }
        }
        out<<x<<" ";
    }
    return 0;
}