#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define per(i,a,b) for (int i = a; i >= b; i--)
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define endl '\n'
const int MAXN = 5e3+10;
const int INF = 1e18+10;
const int MOD = 998244353;
vector<int> g[MAXN], lvl[MAXN];
int h[MAXN], H, par[MAXN];
void dfs(int u, int p = -1) {
H=max(H,h[u]);
lvl[h[u]].pb(u);
par[u] = p;
for(int &v : g[u]) if (v!=p) {
h[v] = h[u] +1;
dfs(v,u);
}
}
void solve() {
int n,m; cin >> n >> m;
rep(i,1,m) {
int u, v; cin >> u >> v;
g[u].pb(v);
g[v].pb(u);
}
dfs(0);
vector<vector<int>> ans;
vector<int> col(n);
rep(i,0,n-1) col[i] = 0;
per(i,H+1,2) {
for(int &x : lvl[i]) col[x] = i;
ans.pb(col);
}
rep(i,0,n-1) col[i] = 0;
col[0] = 1;
rep(i,1,H-1) {
ans.pb(col);
for(int &x : lvl[i]) col[x] = i+1;
}
rep(i,0,n-1) col[i] = i+1;
per(i,n,1) {
col[i] = col[par[i]] = 0;
ans.pb(col);
col[i] = i+1;
col[par[i]] = par[i]+1;
}
cout << ans.size() << endl;
rep(i,0,(int)ans.size()-1) {
for(int &x : ans[i]) cout << x << ' ';
cout << endl;
}
}
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(nullptr);
int tt = 1;
//cin >> tt;
while (tt--) solve();
return 0;
}
