#include <bits/stdc++.h>
using namespace std;
int nr_noduri, nr_muchii, timp;
vector<vector<int>> vecini;
vector<int> tin, low, stiva;
vector<vector<int>> componente;
void dfs(int nod, int parinte) {
tin[nod] = low[nod] = ++timp;
stiva.push_back(nod);
for (int vecin : vecini[nod]) {
if (vecin == parinte) continue;
if (tin[vecin] != 0) {
low[nod] = min(low[nod], tin[vecin]);
} else {
dfs(vecin, nod);
low[nod] = min(low[nod], low[vecin]);
if (low[vecin] >= tin[nod]) {
componente.emplace_back();
int x;
do {
x = stiva.back();
stiva.pop_back();
componente.back().push_back(x);
} while (x != vecin);
componente.back().push_back(nod);
}
}
}
}
int main() {
ifstream fin("biconex.in");
ofstream fout("biconex.out");
fin >> nr_noduri >> nr_muchii;
vecini.resize(nr_noduri + 1);
tin.assign(nr_noduri + 1, 0);
low.assign(nr_noduri + 1, 0);
for (int i = 0; i < nr_muchii; i++) {
int x, y;
fin >> x >> y;
vecini[x].push_back(y);
vecini[y].push_back(x);
}
for (int start = 1; start <= nr_noduri; start++) {
if (tin[start] == 0) {
dfs(start, 0);
stiva.clear();
}
}
fout << componente.size() << "\n";
for (auto& comp : componente) {
for (int nod : comp) fout << nod << " ";
fout << "\n";
}
return 0;
}