#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("biconex.in");
ofstream fout("biconex.out");
const int NMAX = 100001;
const int MMAX = 200001;
int n, m;
int x[MMAX], y[MMAX];
int dfn[NMAX], low[NMAX];
int timp = 0;
vector<pair<int, int> > graf[NMAX];
vector<int> st;
vector<vector<int> > componente;
int marcat[NMAX];
int nrComp = 0;
void dfs(int nod, int tata)
{
dfn[nod] = low[nod] = ++timp;
for (int i = 0; i < (int)graf[nod].size(); i++)
{
int vecin = graf[nod][i].first;
int id = graf[nod][i].second;
if (id == tata)
continue;
if (dfn[vecin] == 0)
{
st.push_back(id);
dfs(vecin, id);
if (low[vecin] < low[nod])
low[nod] = low[vecin];
if (low[vecin] >= dfn[nod])
{
nrComp++;
vector<int> comp;
while (!st.empty())
{
int muchie = st.back();
st.pop_back();
if (marcat[x[muchie]] != nrComp)
{
marcat[x[muchie]] = nrComp;
comp.push_back(x[muchie]);
}
if (marcat[y[muchie]] != nrComp)
{
marcat[y[muchie]] = nrComp;
comp.push_back(y[muchie]);
}
if (muchie == id)
break;
}
componente.push_back(comp);
}
}
else if (dfn[vecin] < dfn[nod])
{
st.push_back(id);
if (dfn[vecin] < low[nod])
low[nod] = dfn[vecin];
}
}
}
int main()
{
fin >> n >> m;
for (int i = 1; i <= m; i++)
{
fin >> x[i] >> y[i];
graf[x[i]].push_back(make_pair(y[i], i));
graf[y[i]].push_back(make_pair(x[i], i));
}
for (int i = 1; i <= n; i++)
{
if (dfn[i] == 0)
{
if (graf[i].empty())
{
vector<int> comp;
comp.push_back(i);
componente.push_back(comp);
}
else
{
dfs(i, 0);
}
}
}
fout << componente.size() << '\n';
for (int i = 0; i < (int)componente.size(); i++)
{
for (int j = 0; j < (int)componente[i].size(); j++)
fout << componente[i][j] << " ";
fout << '\n';
}
fin.close();
fout.close();
return 0;
}