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

const int NMAX = 100100;

int N, M, X, Y, Level[NMAX], Low[NMAX];
stack<pair<int, int> > St;
vector<int> G[NMAX], CrtBic;
vector<vector<int> > Bic;

void GetBiconnectedComp(int X, int Y)
{
    CrtBic.clear();
    pair<int, int> NowEdge;
    do
    {
        NowEdge = St.top();
        St.pop();
        CrtBic.push_back(NowEdge.second);
    }while(NowEdge.first != X && NowEdge.second != Y);
    CrtBic.push_back(NowEdge.first);
    Bic.push_back(CrtBic);
}

void DFS(int Node, int Father)
{
    Low[Node] = Level[Node];
    for(vector<int> :: iterator it = G[Node].begin(); it != G[Node].end(); ++ it)
        if(*it != Father)
        {
            if(Level[*it] == 0)
            {
                St.push(make_pair(Node, *it));
                Level[*it] = Level[Node] + 1;
                DFS(*it, Node);
                Low[Node] = min(Low[Node], Low[*it]);
                if(Low[*it] >= Level[Node]) GetBiconnectedComp(Node, *it);
            }else Low[Node] = min(Low[Node], Low[*it]);
        }
}

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

    scanf("%i %i", &N, &M);
    for(int i = 1; i <= M; ++ i)
    {
        scanf("%i %i", &X, &Y);
        G[X].push_back(Y);
        G[Y].push_back(X);
    }
    for(int i = 1; i <= N; ++ i)
        if(!Level[i])
        {
            Level[i] = 1;
            DFS(1, 0);
        }
    printf("%i\n", Bic.size());
    for(int i = 0; i < Bic.size(); ++ i)
    {
        for(int j = 0; j < Bic[i].size(); ++ j)
            printf("%i ", Bic[i][j]);
        printf("\n");
    }
}