#include <iostream>
#include <fstream>
#include <stack>
#include <set>
#include <utility>
#include <vector>
using namespace std;
ifstream fin("biconex.in");
ofstream fout("biconex.out");
int n, m, cnt=0;
vector<vector<int>> adj;
vector<int> viz, ord,minord;
stack<pair<int,int>> st;
vector<set<int>> comp;
void DFS2(int nod, int parinte){
cnt++;
ord[nod] = cnt;
minord[nod] = cnt;
viz[nod] = 1;
for(int i : adj[nod]){
if(i!=parinte){
if(viz[i]==0){
st.push({nod,i});
DFS2(i,nod);
if(minord[i]>=ord[nod]){ //subarborele lui i nu poate ajunge deasupra lui nod
set<int> componenta;
int x,y;
while(!st.empty()){
x=st.top().first;
y=st.top().second;
st.pop();
componenta.insert(x);
componenta.insert(y);
if(x==nod && y==i)break;
}
comp.push_back(componenta);
}
if(minord[i]<minord[nod]){
minord[nod] = minord[i];
}
}else{
if(ord[i]<ord[nod]){ //muchie spre un stramos
st.push({nod,i});
if(ord[i]<minord[nod]){
minord[nod]=ord[i];
}
}
}
}
}
}
int main()
{
fin>>n>>m;
adj.resize(n+5);
viz.resize(n+5);
ord.resize(n+5);
minord.resize(n+5);
for(int i=1; i<=m; i++){
int x, y;
fin>>x>>y;
adj[x].push_back(y);
adj[y].push_back(x);
}
for(int i=1; i<=n; i++){
if(viz[i]==0) DFS2(i,0);
}
fout<<comp.size()<<endl;
for(int i=0; i<comp.size(); i++){
for(int nod:comp[i]){
fout<<nod<<" ";
}
fout<<endl;
}
return 0;
}