#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() (rand() >> 3)*rand()
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
int n, m, a, b, t, p[500005];
bool u[500005], u2[500005];
vector<pii> v[500005];
vector<int> s, ans;
void dfs(int N){
if (u[N]){
t=-1;
ans=vector<int>();
while(t!=N){
ans.pb(t=s.back()); s.pop_back();
u[t]=0;
}
fox(l, ans.size()){
printf("%i", ans[l]);
if (l!=ans.size()-1) printf(" ");
} printf("\n");
}
if (!u2[v[N][p[N]].y]){
u[N]=1;
s.pb(N);
u2[v[N][p[N]].y]=1;
++p[N];
dfs(v[N][p[N]-1].x);
}
}
int main(){
scan(n); scan(m);
fox(l, m){
scan(a); scan(b);
v[a].pb(mp(b, l));
v[b].pb(mp(a, l));
}
dfs(1);
return 0;
}
