#include<cstdio>
#include<vector>
using namespace std;
vector<int>L[100100];
int n,m,i,j,a,b,v[100100],x[100100],nr,y[100100];
FILE *f,*g;
void dfs(int nod){
    int i;
    y[nod]=1;
    for(i=0;i<L[nod].size();i++){
        if(y[L[nod][i]]==0)
            dfs(L[nod][i]);
    }
    v[++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);
        x[b]=1;
    }
    for(i=1;i<=n;i++){
        if(x[i]==0)
            dfs(i);
    }
    for(i=nr;i>=1;i--){
        fprintf(g,"%d ",v[i]);
    }


    fclose(f);
    fclose(g);
    return 0;
}