#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define ull unsigned long long
#define pb emplace_back
using namespace std; 
const int N = 107, mod = 998244353;
int n, m, tot;
vi e[N], G[N];
mt19937 rng;
int root, win;
int dfn[N], idt;
int fa[N];
int dep[N];
void dfs1(int x) {
	dfn[x] = ++idt;
	shuffle(e[x].begin(), e[x].end(), rng);
	dep[x] = dep[fa[x]] + 1;
	for(auto v : e[x]) {
		if(!dfn[v]) {
			fa[v] = x;
			G[x].pb(v);
			dfs1(v);
		}
	}
}
vector<vi>ans;
vi cur;
void dfs2(int x) {
	for(auto v : G[x]) {
		vi tmp(n);
		L(i, 0, n - 1) tmp[i] = i;
		tmp[v - 1] = tmp[x - 1];
		ans.pb(tmp);
		dfs2(v);
		ans.pb(tmp);
	}
}
bool graph[N][N];
int ramp[N], nramp[N];
int vis[N];
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> m;
	L(i, 1, m) {
		int u, v;
		cin >> u >> v;
		++u;
		++v;
		e[u].pb(v);
		e[v].pb(u);
	}
	if(m == n * (n - 1) / 2) {
		cout << n << '\n';
		L(i, 1, n) {
			L(j, 1, n) cout << ((j + (i & 1)) / 2) << ' ';
			cout << '\n';
		}
		return 0;
	}
	while(true) {
		root = rng() % n + 1;
		L(i, 1, n) dfn[i] = 0, G[i].clear();
		L(i, 1, n) vis[i] = 0;
		for(auto p : e[root])vis[p] = 1;
		idt = 0, fa[root] = 0;
		dfs1(root);
		win = -1;
		for(auto v : G[root]) {
			int good = 1;
			for(auto p : G[v]) if(p != v)good &= !vis[p];
			if(good) win = v;
		}
		if(win != -1) break;
	}
	R(d, n, 1) {
		vi qwq(n);
		L(i, 1, n) qwq[i - 1] = i;
		L(i, 1, n) if(dep[i] <= d && (dep[i] - d) % 2 == 0) qwq[i - 1] = fa[i];
		if(d % 2 == 0) {
			qwq[root - 1] = win;
		} 
		ans.pb(qwq);
	}
	dfs2(root);
	L(d, 1, n) {
		vi qwq(n);
		L(i, 1, n) qwq[i - 1] = i;
		L(i, 1, n) if(dep[i] <= d && (dep[i] - d) % 2 == 0) qwq[i - 1] = fa[i];
		if(d % 2 == 0) {
			qwq[root - 1] = win;
		}
		ans.pb(qwq); 
	}
	R(d, n - 1, 1) {
		vi qwq(n);
		L(i, 1, n) qwq[i - 1] = i;
		L(i, 1, n) if(dep[i] <= d && (dep[i] - d) % 2 == 0) qwq[i - 1] = fa[i];
		if(d % 2 == 0) {
			qwq[root - 1] = win;
		} 
		ans.pb(qwq);
	}
	cout << sz(ans) << '\n';
	for(auto u : ans) {
		for(auto v : u) cout << v << ' ';
		cout << '\n';
	}
	// L(i, 1, n) ramp[i] = i;
	// for(auto u : ans) {
	// 	L(i, 1, n) {
	// 		vi qwq;
	// 		L(j, 1, n) if(i != j && u[ramp[i] - 1] == u[j - 1])qwq.pb(j);
	// 		if(sz(qwq)) nramp[i] = qwq[0];
	// 		else nramp[i] = i;
	// 	}
	// 	swap(ramp, nramp);
	// }
	return 0;
}