#include<bits/stdc++.h>
using namespace std;

const int maxN=(1e5)+5;

int st[maxN],cbc,low[maxN],lvl[maxN],vf;
bool seen[maxN];

vector<int> v[maxN],C[maxN];

void dfs(int nod,int fat,int niv)
{
    st[++vf]=nod;
    low[nod]=niv;
    lvl[nod]=niv;
    seen[nod]=1;

    for(auto it:v[nod])
    {
        if(it==fat) continue;
        if(seen[it])
        {
            low[nod]=min(low[nod],lvl[it]);
            continue;
        }

        dfs(it,nod,niv+1);

        low[nod]=min(low[nod],low[it]);

        if(low[it]>=lvl[nod])
        {
            cbc++;
            int x=0;
            do
            {
                x=st[vf];
                vf--;
                C[cbc].push_back(x);
            }while(x!=it);
            C[cbc].push_back(nod);
        }
    }


}
int n,m,x,y;

int main()
{
    freopen("biconex.in","r",stdin);
    freopen("biconex.out","w",stdout);


    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
        v[y].push_back(x);
    }


    dfs(1,0,1);

    printf("%d\n",cbc);

    for(int i=1;i<=cbc;i++)
    {
        for(auto it:C[i])
            printf("%d ",it);
        printf("\n");
    }

    return 0;
}