#include <bits/stdc++.h>

using namespace std;

struct nod{
    int inf;
    nod *urm;
}*l[50010],*aux;

int n,nr,sol[50010],viz[50010],m;

void df(int x){
    nod *i;
    viz[x]=1;
    for (i=l[x];i!=NULL;i=i->urm){
        if (!viz[i->inf]){
            df(i->inf);
        }

    }
    sol[--nr]=x;
}

int main()
{
    int i,x,y;
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (i=1;i<=m;i++){
        scanf("%d%d",&x,&y);
        aux = new nod;
        aux->urm=l[x];
        aux->inf=y;
        l[x]=aux;
    }
    nr=n+1;
    df(1);
    for (i=1;i<=n;i++) printf("%d ",sol[i]);
    return 0;
}