#include<cstdio>

#include<iostream>

#include<algorithm>

#include<cstring>

#include<vector>

#define ll long long

#define R register int

static char B[<<],*S=B,*D=B;

#define getchar() (S==D&&(D=(S=B)+fread(B,1,1<<15,stdin),S==D)?EOF:*S++)

using namespace std;

inline int g() {

    R ret=,fix=; register char ch; while(!isdigit(ch=getchar())) fix=ch=='-'?-:fix;

    do ret=ret*+(ch^); while(isdigit(ch=getchar())); return ret*fix;

} int n,m,tot;

int ans[]; bool vis[],used[][];

int w[][];

inline void dfs1(int u) { vis[u]=true; ans[++tot]=u;

    for(R i=,lim=w[u][];i<=lim;++i) { R v=w[u][i];

        if(!vis[v]) dfs1(v);

    }

} int s[]; int U,V;

pair<int,int> e[];

inline void dfs2(int u) { vis[u]=true; s[++tot]=u;

    for(R i=,lim=w[u][];i<=lim;++i) { R v=w[u][i];

        if((u==U&&v==V)||(u==V&&v==U)) continue;

        if(!vis[v]) dfs2(v);

    }

}

inline bool ck() {for(R i=;i<=n;++i) if(s[i]!=ans[i]) return ans[i]>s[i];  return false;}

signed main() {

    n=g(),m=g(); for(R i=,u,v;i<=m;++i) u=g(),v=g(),w[u][++w[u][]]=v,w[v][++w[v][]]=u,e[i]=make_pair(u,v);

    for(R i=;i<=n;++i) sort(w[i]+,w[i]+w[i][]+);

    if(m==n-) {

        dfs1(); for(R i=;i<=n;++i) printf("%d ",ans[i]);

    } else {

        for(R i=;i<=n;++i) ans[i]=n-i+;

        for(R i=;i<=m;++i) {

            tot=; memset(vis,,sizeof(vis)); U=e[i].first,V=e[i].second;

            dfs2(); if(tot==n&&ck()) memcpy(ans,s,sizeof(s));

        } for(R i=;i<=n;++i) printf("%d ",ans[i]);

    }

}