#include <cstdio>
#include <algorithm>
#include <stack>
#include <bitset>
#include <vector>

using namespace std;
#define Nmax 100005

bitset<Nmax>used;
stack<int> S;
vector<int> G[Nmax],bix[Nmax];
int N,M,nrb;
int nivel[Nmax],low[Nmax];

void Read()
{
    scanf("%d%d",&N,&M);
    int a,b;
    for(int i = 1; i <= M; ++i)
    {
        scanf("%d%d",&a,&b);
        G[a].push_back(b);
        G[b].push_back(a);
    }
}


void scoate(int k)
{
    while(S.top() != k)
    {
        bix[nrb].push_back(S.top());
        S.pop();
    }
    bix[nrb].push_back(S.top());
    S.pop();
}

void DFS(int k,int dad)
{
    used[k] = 1;
    nivel[k] = nivel[dad] + 1;
    low[k] = nivel[k];
    for(vector<int>::iterator it = G[k].begin(); it != G[k].end(); ++it)
        if(!used[*it])
        {
            S.push(*it);
            DFS(*it,k);
            low[k] = min(low[k],low[*it]);
            if(nivel[k] <= low[*it]){
                ++nrb;
                scoate(*it);
                bix[nrb].push_back(k);
            }
        }
        else
            if(*it != dad && nivel[*it] < low[k])
                low[k] = nivel[*it];
}

void Solve()
{
    for(int i = 1; i <= N; ++i)
        if(!used[i])
        {
            S.push(i);
            DFS(i,0);
            S.pop();
        }
}


void Print()
{
    printf("%d\n",nrb);
    for(int i = 1; i <= nrb; ++i)
    {
        for(vector<int>::iterator it = bix[i].begin(); it != bix[i].end(); ++it)
            printf("%d ",*it);
        printf("\n");
    }
}

int main()
{
    freopen("biconex.in","r",stdin);
    freopen("biconex.out","w",stdout);

    Read();
    Solve();
    Print();

    return 0;
}