#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>

using namespace std;

#define pii pair <int, int>

string filename = "biconex";

#ifdef LOCAL
    ifstream fin("input.in");
    ofstream fout("output.out");
#else
    ifstream fin(filename + ".in");
    ofstream fout(filename + ".out");
#endif

const int NMAX = 1e5;

vector <int> adj[NMAX + 1];

int level[NMAX + 1];
int ll[NMAX + 1];

bool viz[NMAX + 1];

stack <int> S;

int nrComps = 0;
vector <int> comps[NMAX + 1];

void dfs(int node, int parent){
    viz[node] = true;
    level[node] = ll[node] = level[parent] + 1;
    S.push(node);

    for(int vec : adj[node]){
        if(vec != parent){
            if(!viz[vec]){
                dfs(vec, node);
                ll[node] = min(ll[node], ll[vec]);

                if(ll[vec] >= level[node]){
                    ++nrComps;
                    while(S.top() != vec){
                        comps[nrComps].push_back(S.top());
                        S.pop();
                    }
                    comps[nrComps].push_back(vec);
                    S.pop();
                    comps[nrComps].push_back(node);
                }
            }else{
                ll[node] = min(ll[node], level[vec]);
            }
        }
    }
}

int main(){

    int n, m;
    fin >> n >> m;

    for(int i = 1; i <= m; i++){
        int a, b;
        fin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    dfs(1, 0);

    fout << nrComps << '\n';
    for(int i = 1; i <= nrComps; i++){
        for(int node : comps[i]){
            fout << node << ' ';
        }
        fout << '\n';
    }

    return 0;
}