#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "biconex";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 100000 + 5;

int N, M, cbc;
vector<int> V[NMAX];
vector<int> C[NMAX];
vector<int> S;
int lvl[NMAX];
int low[NMAX];
int dad[NMAX];
bitset<NMAX> viz;

void get_biconex(int x, int y) {
    int z;

    cbc++;

    while(!S.empty()) {
        z = S.back();
        C[cbc].push_back(z);
        S.pop_back();
        if(z == y)
            break;
    }

    C[cbc].push_back(x);
}

void dfs(int x) {
    viz[x] = 1;
    lvl[x] = low[x] = lvl[dad[x]] + 1;

    for(auto y : V[x]) {
        if(y == dad[x])
            continue;

        if(!viz[y]) {
            dad[y] = x;

            S.push_back(y);

            dfs(y);

            if(low[y] >= lvl[x])
                get_biconex(x, y);

            low[x] = min(low[x], low[y]);
        }

        low[x] = min(low[x], lvl[y]);
    }
}

int main() {
    int i, x, y;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d%d", &N, &M);

    while(M--) {
        scanf("%d%d", &x, &y);
        V[x].push_back(y);
        V[y].push_back(x);
    }

    for(i = 1; i <= N; i++)
        if(!viz[i])
            dfs(i);

    printf("%d\n", cbc);

    for(i = 1; i <= cbc; i++) {
        for(auto x : C[i])
            printf("%d ", x);
        printf("\n");
    }

    return 0;
}