#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define int long long
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define pb push_back
const int MAXN=1e2+10;
typedef pair<int,int> pii;
int n,m;
vector<vector<int>> ans;
vector<int> g[MAXN];
bool mark[MAXN];
void show(vector<int> a){
for(auto x:a) cout<<x<<" ";
cout<<"\n";
}
vector<int> get(int a,int b){
vector<int> cor(n); iota(all(cor),0);
cor[b]=a;
return cor;
}
void dfs(int x){
mark[x]=1;
for(auto u:g[x]){
if(mark[u]) continue;
ans.pb(get(u,x));
dfs(u);
ans.pb(get(u,x));
}
}
int32_t main(){
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>m;
fall(i,1,m){
int a,b; cin>>a>>b;
g[a].pb(b),g[b].pb(a);
}
fall(i,0,n-1){
fall(j,0,n-1) mark[j]=0;
dfs(i);
}
cout<<sz(ans)<<"\n";
for(auto ar:ans){
for(auto u:ar) cout<<u<<" ";
cout<<"\n";
}
}
