#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
void dfs(int u, int p, const vector<vector<int>>& graf, vector<int>& niv, vector<int>& niv_min, stack<int>& st, vector<vector<int>>& componente, int& timp) {
timp++;
niv[u] = timp;
niv_min[u] = timp;
st.push(u);
for (int v : graf[u]) {
if (v==p) {
continue;
}
if (niv[v]>0)
niv_min[u] = min(niv_min[u], niv[v]);
else {
dfs(v, u, graf, niv, niv_min, st, componente, timp);
niv_min[u] = min(niv_min[u], niv_min[v]);
if (niv_min[v]>=niv[u]) {
vector<int> comp_curenta;
int nod= -1;
while (nod!=v) {
nod =st.top();
st.pop();
comp_curenta.push_back(nod);
}
comp_curenta.push_back(u);
componente.push_back(comp_curenta);
}
}
}
}
int main() {
ifstream f("biconex.in");
ofstream g("biconex.out");
int n, m;
f>>n>>m;
vector<vector<int>> graf(n + 1);
for (int i=0;i<m;++i) {
int u, v;
f>>u>>v;
graf[u].push_back(v);
graf[v].push_back(u);
}
vector<int> niv(n+1,0);
vector<int> niv_min(n+1,0);
stack<int> st;
vector<vector<int>> componente;
int timp = 0;
for (int i=1;i<=n;++i)
if (niv[i]==0)
dfs(i,0,graf, niv,niv_min,st,componente,timp);
g<<componente.size() << "\n";
for (const auto& comp : componente) {
for (int nod : comp)
g<<nod<< " ";
g<<"\n";
}
return 0;
}