#include<cstdio>
#include<vector>
using namespace std;
vector<int>L[50100];
int n,m,i,j,a,b,nr,sol[50100],v[50100],t[50100];
FILE *f,*g;
void dfs(int nod){
    for(int i = 0; i < L[nod].size();  i++){
        if(!v[ L[nod][i] ]){
            v[ L[nod][i] ] = 1;
            dfs(L[nod][i]);
        }
    }
    sol[++nr] = nod;
}
int main(){
    f = fopen("sortaret.in","r");
    g = fopen("sortaret.out","w");
    fscanf(f,"%d%d",&n,&m);
    for(i = 1; i <= m; i ++){
        fscanf(f,"%d%d",&a,&b);
        L[a].push_back(b);
        t[b] = a;
    }
    for(i = 1; i <= n; i ++){
        if(t[i] == 0){
            dfs(i);
        }
    }
    for(i = n; i >= 1; i --){
        fprintf(g,"%d ",sol[i]);
    }
    fclose(f);
    fclose(g);
    return 0;
}