#include <bits/stdc++.h>
#define NMAX 100010
#define pb push_back
using namespace std;

ifstream f("biconex.in");
ofstream g("biconex.out");

int n, m, y, x, cate;
deque <int> Q;
bitset <NMAX> viz;
int low[NMAX], niv[NMAX];
vector <int> G[NMAX], sol[NMAX];

void DFS(int dad, int nod)
{
    viz[nod] = 1;
    low[nod] = niv[nod];
    Q.pb(nod);
    for(int i = 0 ; i < G[nod].size(); ++i)
    {
        int v = G[nod][i];
        if(v == dad)
            continue;
        if(viz[v])
        {
            low[nod] = min(low[nod], niv[v]);
            continue;
        }
        niv[v] = niv[nod] + 1;
        DFS(nod, v);
        low[nod] = min(low[nod], low[v]);
        if(low[v] >= niv[nod])
        {
            cate++;
            int u;
            do
            {
                sol[cate].pb(Q.back());
                u = Q.back();
                Q.pop_back();
            }while(!Q.empty() && u != v);
            sol[cate].pb(nod);
        }
    }
}

int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        f >> x >> y;
        G[x].pb(y);
        G[y].pb(x);
    }
    DFS(0,1);
    g << cate << '\n';
    for(int i = 1; i <= cate; ++i, g << '\n')
        for(int j = 0; j < sol[i].size(); ++j)
            g << sol[i][j] << ' ';
    f.close();
    g.close();
    return 0;
}