// In The Name Of Allah
#include <bits/stdc++.h>
#define ss second
#define ff first
#define use_fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define se(n) cout << setprecision(n) << fixed
#define pb push_back
//#define ll long long
#define ld long double
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int N = 5e5 + 100, OO = 1e9 + 7, K = 1e7 + 4, T = 22, M = 1e9 + 7, P = 6151, SQ = 1300, lg = 22;
typedef pair <int, int> pii;
bool mark[N];
int num[N], ET[N], l[N], r[N], nw[N], ht[N], nxt = 0;
vector <int> v[N];
inline void dfs(int x) {
for(; nw[x] < (int)v[x].size(); nw[x]++) {
int p = v[x][nw[x]];
if(mark[p])
continue;
mark[p] = true;
dfs(l[p] ^ r[p] ^ x);
ET[nxt++] = x;
}
}
int32_t main() {
int n, m;
scanf("%d%d", &n, &m);
for(int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
v[r[i]].pb(i);
v[l[i]].pb(i);
}
dfs(1);
int sz = -1;
for(int i = 0; i < nxt; i++) {
int u = ET[i];
if(num[u]) {
printf("%d", u);
while(ht[sz] != u)
printf(" %d", ht[sz]), num[ht[sz]]--, sz--;
cout << "\n";
}
else
ht[++sz] = u, num[u]++;
}
for(int i = 0; i <= sz; i++)
printf("%d ", ht[i]);
return 0;
}
