#include <fstream>
#include <cmath>
#include <algorithm>
using namespace std;
ifstream f("biconex.in");
ofstream g("biconex.out");
struct nod
{
    int val;
    nod *urm;
};
typedef nod *pnod;
#define nmax 100100
pnod v[nmax],p;
struct segment
{
    int x,y;
};
segment st[3*nmax];
int ind[nmax],t[nmax],mind[nmax],q[3*nmax];
void ad(int x,int y)
{
    p=new nod;
    p->val=y;
    p->urm=v[x]->urm;
    v[x]->urm=p;
}
int index,ss,cate,total,sfarsit,cur;
void tarjan(int inc)
{
    index+=1;
    ss+=1;
    st[ss].x=inc;
    ind[inc]=index;
    mind[inc]=index;
    pnod p=v[inc]->urm;
    while(p)
    {
        if(ind[p->val]==0)
        {
            t[p->val]=inc;
            st[ss].y=p->val;
            tarjan(p->val);
            mind[inc]=min(mind[inc],mind[p->val]);
            if(ind[inc]<=mind[p->val])
            {
                cate+=1;
                cur=sfarsit+1;
                while(st[ss].x!=inc and st[ss].y!=p->val)
                {
                    sfarsit+=1;
                    q[sfarsit]=st[ss].x;
                    ss-=1;
                }
                sfarsit+=1;
                q[sfarsit]=inc;
                sort(q+cur,q+sfarsit+1);
                sfarsit+=1;
                q[sfarsit]=0;
            }
        }
        else
        {
            if(t[inc]!=p->val)
                mind[inc]=min(mind[inc],ind[p->val]);
        }
        p=p->urm;
    }
}
int main()
{
    int n,m,i,x,y;
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        v[i]=new nod;
        v[i]->urm=0;
    }
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        ad(x,y);
        ad(y,x);
    }
    for(i=1;i<=n;i++)
    {
        if(ind[i]==0)
        {
            index=0;
            ss=0;
            tarjan(i);
        }
    }
    g<<cate<<'\n';
    int k=1;
    for(i=1;i<=cate;i+=1)
    {
        while(q[k]!=0)
        {
            g<<q[k]<<" ";
            k+=1;
        }
        k+=1;
        g<<'\n';
       // i+=1;
    }
    return 0;
}