#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

vector <int > g[100005];
vector <int > sol[100005];
vector <pair < int , int > >st;
int n,m,low[100005],niv[100005],nrsol,k;

void citire()
{
    scanf("%d%d",&n,&m);
    for (int i=1;i<=m;++i)
    {
        int nod1,nod2;
        scanf("%d%d",&nod1,&nod2);
        g[nod1].push_back(nod2);
        g[nod2].push_back(nod1);
    }
}
void golire(int xnod,int ynod)
{
    int nodx,nody;
    do
    {
        nodx=st.back().first;
        nody=st.back().second;
        sol[nrsol].push_back(nody);
        sol[nrsol].push_back(nodx);
        st.pop_back();
    }
    while (nodx!=xnod || ynod!=nody);
    nrsol++;
}
void dfs(int nod,int tata)
{
    low[nod]=niv[tata]+1;
    niv[nod]=niv[tata]+1;
    for (vector <int > :: iterator it=g[nod].begin();it!=g[nod].end();++it)
    {
        if (!niv[*it])
        {
            st.push_back(make_pair(nod,*it));
            dfs(*it,nod);
            if (low[*it]<low[nod])
                low[nod]=low[*it];
            if(niv[nod]<=low[*it])
                golire(nod,*it);
        }
        else if (*it!=tata && niv[*it]<low[nod])
            low[nod]=niv[*it];
    }
}
void afisare()
{
    printf("%d\n",nrsol);
    for (int i=0;i<nrsol;++i)
    {
        sort(sol[i].begin(),sol[i].end());
        sol[i].erase(unique(sol[i].begin(),sol[i].end()),sol[i].end());
        vector <int > ::iterator it;
        for (it=sol[i].begin();it!=sol[i].end();++it)
            printf("%d ",*it);
        printf("\n");
    }
}
int main()
{
    freopen("biconex.in","r",stdin);
    freopen("biconex.out","w",stdout);
    citire();
    dfs(1,0);
    afisare();
    return 0;
}