#include <bits/stdc++.h>
#define maxN 100005
using namespace std;
vector<int> v[maxN];
vector<int>comp[maxN];
int n,i,j,m,x,y,low[maxN],lvl[maxN],nrcomp;
bool viz[maxN];
stack<pair<int,int> >stk;
void biconex(int n1,int n2)
{
    nrcomp++;
    while(stk.top().first!=n1 && stk.top().second!=n2)
    {
        comp[nrcomp].push_back(stk.top().second);
        stk.pop();
    }
    comp[nrcomp].push_back(n2);
    comp[nrcomp].push_back(n1);
    stk.pop();
}
void dfs(int nod,int tata)
{
    viz[nod]=true;
    lvl[nod]=low[nod]=lvl[tata]+1;
    for(vector<int>::iterator it=v[nod].begin();it!=v[nod].end();it++)
    {
        if(!viz[*it])
        {
            stk.push(make_pair(nod,*it));
            dfs(*it,nod);
            if(low[*it]>=low[nod])
                biconex(nod,*it);
        }
        if(*it!=tata)
            low[nod]=min(low[nod],low[*it]);
    }
}
int main()
{
    freopen("biconex.in","r",stdin);
    freopen("biconex.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(i=1;i<=m;i++)
        scanf("%d %d",&x,&y),
        v[x].push_back(y),
        v[y].push_back(x);
    dfs(1,0);
    printf("%d\n",nrcomp);
    for(i=1;i<=nrcomp;i++)
    {
        //sort(comp[i].begin(),comp[i].end());
        for(vector<int>::iterator it=comp[i].begin();it!=comp[i].end();it++)
            printf("%d ",*it);
        printf("\n");
    }
    return 0;
}