#include <iostream>
#include <cstdio>
#include <vector>

using namespace std;
int n,m,i,j,x,y,t,k,nr,d[100005],low[100005],st[100005];
bool viz[100005];

vector <int> v[100005],sol[100005];

void dfs(int nod, int tata)
{
    t++;
    d[nod]=low[nod]=t;
    st[++k]=nod;
    viz[nod]=1;
    for (int i=0; i<v[nod].size(); i++)
        if (d[v[nod][i]]==0)
         {
               dfs(v[nod][i],nod);
                low[nod]=min(low[nod],low[v[nod][i]]);
           }
         else
            if(v[nod][i]!=tata)
              low[nod]=min(low[nod],d[v[nod][i]]);
    if(low[nod]>=d[tata] && tata!=0){
        nr++;
        sol[nr].push_back(tata);
        do{
            x=st[k--];
            viz[x]=0;
            sol[nr].push_back(x);
        }while(x!=nod&&k>0);

        }

    }


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);
    }
    for(i=1;i<=n;i++)
        if(d[i]==0)
            dfs(i,0);
printf("%d\n",nr);
    for (i=1; i<=nr; i++)
    {
        for (j=0; j<sol[i].size(); j++)
            printf("%d ",sol[i][j]);
        printf("\n");
    }
    return 0;
}