#include <bits/stdc++.h>

using namespace std;
ifstream in("biconex.in");
ofstream out("biconex.out");
int n,m,x,y,st[100100],idx[100100],low[100100],top,c,t,start;
vector<int> v[100100];
vector<int> comp[100100];
void tarjan(int nod)
{
    bool ok=0;
    idx[nod]=t;
    low[nod]=t;
    t++;
    st[++top]=nod;
    int ch=0;
    for(auto it:v[nod])
    {
        if(idx[it]==-1) {
            tarjan(it);
            ch++;
            if(low[it]>=idx[nod])
            {
                ok=1;
                c++;
                x=st[top];
                while(x!=it)
                {
                    comp[c].push_back(x);
                    top--;
                    x=st[top];
                }
                comp[c].push_back(it);
                top--;
                comp[c].push_back(nod);
            }
            low[nod]=min(low[nod],low[it]);
        }
        else low[nod]=min(low[nod],idx[it]);
    }
}
int main()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(int i=1;i<=n;i++) idx[i]=-1;
    for(int i=1;i<=n;i++)
    {
        if(idx[i]==-1)
        {
            t=0;
            top=0;
            start=i;
            tarjan(i);
        }
    }
    out<<c<<'\n';
    for(int i=1;i<=c;i++)
    {
        for(auto it:comp[i]) out<<it<<" ";
        out<<'\n';
    }
    return 0;
}