#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define cmin(a, b) a=min(a, b)
#define cmax(a, b) a=max(a, b)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define int long long
void solve();
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
solve();
return 0;
}
vector<vector<int>> vec;
void print() {
cout << sz(vec) << endl;
for (auto &a: vec) {
for (auto &u: a) cout << u << ' ';
cout << endl;
}
cout << endl;
}
void add(vector<int> &a) { vec.pb(a); }
int n, m;
vector<int> a;
vector<set<int>> adj;
void execute(int x, int par=-1) {
for (auto u: adj[x]) if (u!=par) {
auto temp=a; temp[x]=0, temp[u]=0;
add(temp);
execute(u, x);
add(temp);
}
}
void solve() {
cin >> n >> m; a.clear(), a.resize(n, 0); iota(all(a), 1);
adj.clear(), adj.resize(n);
for (int i=0; i<m; i++) {
int u, v; cin >> u >> v;
adj[u].insert(v), adj[v].insert(u);
}
for (int i=0; i<n-1; i++) {
int best=-1;
for (int j=0; j<n; j++) if (sz(adj[j])!=0 && (best==-1 || sz(adj[best])>sz(adj[j]))) {
best=j;
}
execute(best);
for (auto u: adj[best]) adj[u].erase(best);
adj[best].clear();
}
print();
}
