#include <fstream>
#include <vector>
using namespace std;
ifstream fin("biconex.in");
ofstream fout("biconex.out");
int n, m, timp;
vector<int> g[100001];
int intrare[100001], minim[100001];
int st[100001], vf;
vector<vector<int>> comp;
void dfs(int nod, int tata)
{
timp++;
intrare[nod] = minim[nod] = timp;
vf++;
st[vf] = nod;
for (int vec : g[nod])
{
if (vec == tata)
continue;
if (intrare[vec] != 0)
minim[nod] = min(minim[nod], intrare[vec]);
else
{
dfs(vec, nod);
minim[nod] = min(minim[nod], minim[vec]);
if (minim[vec] >= intrare[nod])
{
vector<int> c;
while (st[vf] != vec)
{
c.push_back(st[vf]);
vf--;
}
c.push_back(vec);
vf--;
c.push_back(nod);
comp.push_back(c);
}
}
}
}
int main()
{
fin >> n >> m;
for (int i = 1; i <= m; i++)
{
int x, y;
fin >> x >> y;
g[x].push_back(y);
g[y].push_back(x);
}
for (int i = 1; i <= n; i++)
if (intrare[i] == 0)
dfs(i, 0);
fout << comp.size() << "\n";
for (auto c : comp)
{
for (int x : c)
fout << x << " ";
fout << "\n";
}
return 0;
}