#include<iostream>
#include<vector>
#include<fstream>
#include<stack>
using namespace std;
ifstream fin("biconex.in");
ofstream fout("biconex.out");
vector<int>g[100005];
int dfn[100005],low[100005],timp;
stack<int>st;
vector<vector<int>>bcc;
void dfs(int u,int p){
dfn[u]=low[u]=++timp;
st.push(u);
for(int v:g[u])
{
if(v==p)continue;
if(!dfn[v]){
dfs(v,u);
low[u]=min(low[u],low[v]);
if(low[v]>=dfn[u]){
vector<int>comp;
comp.push_back(u);
while(true){
int nod=st.top();
st.pop();
comp.push_back(nod);
if(nod==v)
break;
}
bcc.push_back(comp);
}
}
else{
low[u]=min(low[u],dfn[v]);
}
}
}
int main()
{
int n,m;
fin>>n>>m;
for(int i=0;i<m;++i){
int u,v;
fin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
}
for(int i=1;i<=n;++i)
{
if(!dfn[i])
dfs(i,0);
}
fout<<bcc.size()<<"\n";
for(size_t i=0;i<bcc.size();++i){
for(size_t j=0;j<bcc[i].size();++j)
fout<<bcc[i][j]<<" ";
fout<<"\n";
}
fin.close();
fout.close();
return 0;
}