#include<fstream>
#include<vector>
#include<stack>
#define NMAX 100005
using namespace std;
vector<int> G[NMAX], bc[NMAX];
stack<pair<int, int> > s;
int n, m, x, y;
int nbc, lvl;
int niv[NMAX], low[NMAX];
ifstream _cin("biconex.in");
ofstream _cout("biconex.out");
void biconex(int nod, int fiu)
{
    nbc++;
    do
    {
        x = s.top().first;
        y = s.top().second;
        s.pop();
        bc[nbc].push_back(y);
    }
    while(x != nod && y != fiu);
    bc[nbc].push_back(x);
}
void dfsbc(int nod, int tata)
{
    niv[nod] = low[nod] = ++lvl;
    for(int i = 0; i < G[nod].size(); i++)
    {
        int fiu = G[nod][i];
        if(fiu != tata)
        {
            if(niv[fiu] == 0)
            {
                s.push(make_pair(nod, fiu));
                dfsbc(fiu, nod);
                low[nod] = min(low[fiu], low[nod]);
                if(low[fiu] >= niv[nod])
                {
                    biconex(nod, fiu);
                }
            }else
            {
                low[nod] = min(niv[fiu], low[nod]);
            }
        }
    }
}

void afisare()
{
    _cout << nbc << "\n";
    for(int i = 1; i <= nbc; i++)
    {
        for(int j = 0; j < bc[i].size(); j++)
        {
            _cout << bc[i][j] << " ";
        }
        _cout << "\n";
    }
}

int main()
{
    _cin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        _cin >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    for(int i = 1; i <= n; i++)
    {
        if(niv[i] == 0)
        {
            dfsbc(i, 0);
        }
    }
    afisare();
    return 0;
}