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

struct legatura{
    int vecin, urm;
};
int N,M,**A,*viz,*x,k;

void citire(){
    int i,j,l,*Start,*D;
    legatura *L;
    fin>>N>>M;
    L=new legatura[M+2];
    Start=new int[N+2];
    memset(Start,0,(N+2)*sizeof(int));
    D=new int[N+2];
    memset(D,0,(N+2)*sizeof(int));
    k=0;
    for(l=1;l<=M;l++){
        fin>>i>>j;
        D[i]++;
        k++;
        L[k]={j,Start[i]};
        Start[i]=k;
    }
    A=new int*[N+2];
    for(l=1;l<=N;l++){
        A[l]=new int[D[l]+2];
        j=0;
        for(i=Start[l];i!=0;i=L[i].urm){
            j++;
            A[l][j]=L[i].vecin;
        }
        A[l][0]=D[l];
    }
    delete Start;
    delete D;
    delete L;
}

void DFS(int vf){
    int i;
    viz[vf]=1;
    for(i=1;i<=A[vf][0];i++){
        if(viz[A[vf][i]]==0){
            DFS(A[vf][i]);
        }
    }
    k++;
    x[k]=vf;
}

int main(){
    citire();
    x=new int[N+2];
    viz=new int[N+2];
    memset(viz,0,(N+2)*sizeof(int));
    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;
}