#include <fstream>
#include <algorithm>
#include <vector>
std::ifstream fin("biconex.in");
std::ofstream fout("biconex.out");
const int N = 100005;
std::vector<int> graf[N];
std::vector<bool> vizitat(N, false);
int nrComponente = 0;
std::vector<int> componente[N];
std::vector<int> tin(N);
std::vector<int> low(N);
std::vector<int> fii(N);
std::vector<int> stiva;
int timer = 0;
void Tarjan(int nod, int tata)
{
vizitat[nod] = true;
stiva.push_back(nod);
timer++;
tin[nod] = timer;
low[nod] = timer;
for (auto vecin : graf[nod])
{
if (vecin == tata)
{
continue;
}
if (vizitat[vecin] == true)
{
low[nod] = std::min(low[nod], tin[vecin]);
}
else
{
fii[nod]++;
Tarjan(vecin, nod);
low[nod] = std::min(low[nod], low[vecin]);
if (low[vecin] >= tin[nod])
{
nrComponente++;
while (!stiva.empty())
{
componente[nrComponente].push_back(stiva.back());
stiva.pop_back();
}
}
}
}
}
int main()
{
int n, m;
fin >> n >> m;
for (int i{0}; i < m; i++)
{
int x, y;
fin >> x >> y;
graf[x].push_back(y);
graf[y].push_back(x);
}
for (int i{1}; i <= n; i++)
{
if (vizitat[i] == false)
{
Tarjan(i, 0);
}
}
fout << nrComponente << "\n";
for (int i{1}; i <= nrComponente; ++i)
{
for (auto nod : componente[i])
{
fout << nod<<' ';
}
fout<<"\n";
}
}