#include <bits/stdc++.h>
#define MAX 50005
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n,m,A[MAX];
vector<int> Nod[MAX];
queue<int> Q;

void citire();
void rezolvare();

int main(){
    citire();
    rezolvare();
    return 0;
}
void rezolvare(){
    int x,i,sz;
    while(!Q.empty()){
        x=Q.front();
        fout<<x<<' ';
        sz=Nod[x].size();
        for(i=0;i<sz;++i){
            --A[Nod[x][i]];
            if(!A[Nod[x][i]])
                Q.push(Nod[x][i]);
        }
        Q.pop();
    }
}
void citire(){
    int i,x,y;
    fin>>n>>m;
    for(i=0;i<m;++i){
        fin>>x>>y;
        Nod[x].push_back(y);
        ++A[y];
    }
    //calculare Q initial
    for(i=1;i<=n;++i)
        if(!A[i])
            Q.push(i);
}