#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
const int MAX_NODURI = 100005;
vector<int> graf[MAX_NODURI];
int timp_descoperire[MAX_NODURI];
int nivel_minim[MAX_NODURI];
int cronometru = 0;
vector<int> stiva_noduri;
vector<vector<int>> componente_biconexe;
void dfs(int nod, int tata) {
cronometru++;
timp_descoperire[nod] = cronometru;
nivel_minim[nod] = cronometru;
stiva_noduri.push_back(nod);
for (int vecin : graf[nod]) {
if (vecin == tata) {
continue;
}
if (timp_descoperire[vecin] != 0) {
nivel_minim[nod] = min(nivel_minim[nod], timp_descoperire[vecin]);
} else {
dfs(vecin, nod);
nivel_minim[nod] = min(nivel_minim[nod], nivel_minim[vecin]);
if (nivel_minim[vecin] >= timp_descoperire[nod]) {
vector<int> comp_curenta;
while (true) {
int nod_extras = stiva_noduri.back();
stiva_noduri.pop_back();
comp_curenta.push_back(nod_extras);
if (nod_extras == vecin) {
break;
}
}
comp_curenta.push_back(nod);
componente_biconexe.push_back(comp_curenta);
}
}
}
}
int main() {
ifstream fin("biconex.in");
ofstream fout("biconex.out");
int n, m;
fin >> n >> m;
for (int i = 0; i < m; ++i) {
int u, v;
fin >> u >> v;
graf[u].push_back(v);
graf[v].push_back(u);
}
for (int i = 1; i <= n; ++i) {
if (timp_descoperire[i] == 0) {
dfs(i, 0);
}
}
fout << componente_biconexe.size() << "\n";
for (int i = 0; i < componente_biconexe.size(); ++i) {
for (int nod : componente_biconexe[i]) {
fout << nod << " ";
}
fout << "\n";
}
fin.close();
fout.close();
return 0;
}