#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;

ifstream fin("biconex.in");
ofstream fout("biconex.out");

vector<vector<int>> G;
bool sel[100];
stack<pair<int, int>> s;
int niv[100];
int Lmin[100];
vector<vector<int>> comp;
int n, m, k;
vector<int> c;
int x1, x2, ind;
vector<int> t;
void Df(int x);
void Write();

int main()
{
	fin >> n >> m;
	
	G = vector<vector<int>>(n + 1);
	t = vector<int>(n + 1);
	for(int i = 1; i <= m; ++i)
	{
		fin >> x1 >> x2;
		G[x1].push_back(x2);
		G[x2].push_back(x1);
	}
	t[1] = 0;
	Df(1);
	Write();
	fin.close();
	fout.close();
	return 0;
}

void Df(int x)
{
	++ind;
	Lmin[x] = ind;
	niv[x] = ind;
	sel[x] = true;
	for (auto y : G[x])
	{
		t[y] = x;
		if (y == t[y])
			continue;
		if(!sel[y])
		{
			s.push({x, y});
			Df(y);
			Lmin[x] = min(Lmin[x], Lmin[y]);
			if (Lmin[y] >= niv[x])
			{
				c.clear();
				while (true)
				{
					x1 = s.top().first;
					x2 = s.top().second;
					s.pop();
					c.push_back(x1);
					c.push_back(x2);
					if (x1 == x && x2 == y)
						break;
				}
				comp.push_back(c);
			}
		}
		else
			Lmin[x] = min(Lmin[x], niv[y]);
	}
}

void Write()
{
	fout << comp.size() << '\n';
	for (auto& c : comp)
	{
		sort(c.begin(), c.end());
		c.erase(unique(c.begin(), c.end()), c.end());
		for (const auto& x : c)
			fout << x << ' ';
		fout << '\n';
	}
		
}