#include<stdio.h>
using namespace std;

FILE*f=fopen("ciclueuler.in","r");
FILE*g=fopen("ciclueuler.out","w");

struct nod {
    int inf;
    nod *urm;
} *v[100005];

int okk,pp,ok,ni,n,m,s,x,y,i,q[100005],viz[100005],d[100005];

void adaug(nod *&a, int x) {
    nod *p=new nod;
    p->inf=x; p->urm=a;
    a=p;
}

int grad(int x) {
    int k;
    nod *i;
    for(i=v[x];i!=NULL;i=i->urm) k++;
    return k;
}

void bf(int x) {
    int p=1,u=1,k;
    nod *j;
    q[1]=x; viz[x]=1; d[x]=0;
    for(k=1;k<=n;k++) viz[k]=0;
    while(p<=u) {
        for(j=v[x];j!=NULL;j=j->urm)
            if(viz[j->inf]==0) {
                viz[j->inf]=1;
                q[++u]=j->inf;
                d[j->inf]=d[x]+1;
            }
        p++; x=q[p];
    }
}

int verif() {
    int i;
    for(i=1;i<=n;i++)
        if(grad(i)%2==1) return 0;
    return 1;
}

void afis(int i) {
    int ok,k,z;
    if(okk==1)
    for(nod *j=v[i];j!=NULL;j++) {
        if(j->inf!=-1) {
            z=j->inf;
            j->inf=0;
            bf(i);
            for(k=1;k<=n;k++)
                if(viz[k]==0) {ok=1; break;}
            if(ok==0) j->inf=z;
            else {
                fprintf(g,"%d ",i);
                if(j->inf==pp) okk=0;
                afis(j->inf); break;
            }
        }
    }

}

int main() {
    fscanf(f,"%d%d",&n,&m);

    for(i=1;i<=m;i++) {
        fscanf(f,"%d%d",&x,&y);
        adaug(v[x],y);
    }

    for(i=1;i<=n;i++)
        if(viz[i]==0) {
            bf(i);
            if(verif()) {
                pp=i; okk=1;
                afis(i);
                break;
            }
        }

    return 0;
}