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

struct legatura{
    int vfi,vfe;
}*L;
bool comp(legatura x, legatura y){
    if(x.vfi<y.vfi)return 1;
    return 0;
}
int N,M,*Start,*D,*viz,*X,K;

void citire(){
    int i,j,l,k;
    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));
    for(l=1;l<=M;l++){
        fin>>i>>j;
        L[l].vfi=i;
        L[l].vfe=j;
        D[i]++;
    }
    sort(L+1,L+M+1,comp);
    Start[L[1].vfi]=1;
    for(l=2;l<=M;l++){
        if(L[l-1].vfi<L[l].vfi){
            Start[L[l].vfi]=l;
        }
    }
}

void DFS(int vf){
    int i;
    viz[vf]=1;
    for(i=Start[vf];i<=Start[vf]+D[vf]-1;i++){
        if(viz[L[i].vfe]==0){
            DFS(L[i].vfe);
        }
    }
    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;
}