#include<bits/stdc++.h>
using namespace std;
ifstream f("biconex.in");
ofstream g("biconex.out");
int N,M,x,y,nr,cont,v1[100001],v2[100001],st[100001];
vector <int> G[100001],sol[100001];
void dfs(int nod){
    st[++nr]=nod;
    for(int i=0;i<G[nod].size();++i)
        if(!v1[G[nod][i]]){
            v1[G[nod][i]]=v2[G[nod][i]]=v1[nod]+1;
            int k=nr;
            dfs(G[nod][i]);
            v2[nod]=min(v2[nod],v2[G[nod][i]]);
            if(v2[G[nod][i]]>=v1[nod]){
                ++cont;
                while(nr>k)sol[cont].push_back(st[nr--]);
                sol[cont].push_back(nod);
            }
        }else v2[nod]=min(v2[nod],v1[G[nod][i]]);
}
int main()
{
    f>>N>>M;
    while(M--){
        f>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    v1[1]=v2[1]=1;
    dfs(1);
    g<<cont<<'\n';
    for(int i=1;i<=cont;++i){
        for(int j=0;j<sol[i].size();++j)g<<sol[i][j]<<' ';
        g<<'\n';
    }
    return 0;
}