#include <fstream>
#include <algorithm>
#include<cstring>
#define Nmax 50002
#define Mmax 100002
using namespace std;
ifstream  fin("sortaret.in");
ofstream fout("sortaret.out");

struct legatura{
    int vecin, urm;
};
legatura L[Mmax];
int N,M,Start[Nmax],viz[Nmax],X{Nmax],K;

void citire(){
    int i,j,l,k;
    fin>>N>>M;
    k=0;
    for(l=1;l<=M;l++){
        fin>>i>>j;
        k++;
        L[k]={j,Start[i]};
        Start[i]=k;
    }
}

void DFS(int vf){
    int i;
    viz[vf]=1;
    for(i=Start[vf];i!=0;i=L[i].urm){
        if(viz[L[i].vecin]==0){
            DFS(L[i].vecin);
        }
    }
    X[++K]=vf;
}

int main(){
    citire();
    K=0;
    for(int i=1;i<=N;i++){
        if(viz[i]==0){
            DFS(i);
        }
    }
    for(int i=N;i>=1;i--){
        fout<<X[i]<<" ";
    }
    fout.close();
    fin.close();
    return 0;
}