#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
ifstream fin("biconex.in");
ofstream fout("biconex.out");
const int MAXN = 100005;
vector<int> adj[MAXN];
int tin[MAXN], low[MAXN];
int timer;
stack<int> st;
vector<vector<int>> biconnected_components;
void dfs(int u, int p = -1) {
tin[u] = low[u] = ++timer;
st.push(u);
for (int v : adj[u]) {
if (v == p) continue;
if (tin[v]) {
low[u] = min(low[u], tin[v]);
} else {
dfs(v, u);
low[u] = min(low[u], low[v]);
if (low[v] >= tin[u]) {
vector<int> component;
int node;
do {
node = st.top();
st.pop();
component.push_back(node);
} while (node != v);
component.push_back(u);
biconnected_components.push_back(component);
}
}
}
}
int main() {
int n, m;
if (!(fin >> n >> m)) return 0;
for (int i = 0; i < m; ++i) {
int u, v;
fin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
for (int i = 1; i <= n; ++i) {
if (!tin[i]) {
dfs(i);
}
}
fout << biconnected_components.size() << "\n";
for (const auto& comp : biconnected_components) {
for (int node : comp) {
fout << node << " ";
}
fout << "\n";
}
return 0;
}