// Oh damn, cann't you see I'm fine?

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'

const int N = 1e5 + 5;

#define x first
#define y second

int n, m;
vector <int> g[N];

int cnt = 1;
bool mark[N];
int seen[N];
int lowest_seen[N];

void dfs(int u, int p) {
	lowest_seen[u] = seen[u] = cnt++;
	for(int v : g[u]) {
		if(!seen[v]) {
			dfs(v, u);
			if(lowest_seen[v] >= seen[u]) mark[u] = 1;
			lowest_seen[u] = min(lowest_seen[u], lowest_seen[v]);
		}
		else if(v != p) {
			lowest_seen[u] = min(lowest_seen[v], seen[v]);
		}
	}
}

void dfs1(int u, int p) {
	seen[u] = p;
	if(u != p && mark[u]) return;
	for(int v : g[u]) {
		if(seen[v] == 0) dfs1(v, p);
	}
}

bool vis[N];
vector <int> res;
vector <int> vis_list;

void dfs2(int u, int p) {
	vis[u] = 1;
	vis_list.push_back(u);
	res.push_back(u);
	for(int v : g[u]) {
		if(!vis[v] && seen[v] == p) dfs2(v, p);
	}
}

int main() {
	freopen("biconex.in", "r", stdin);
	freopen("biconex.out", "w", stdout);

	cin >> n >> m;
	for(int i=0; i<m; i++) {
		int x, y;
		cin >> x >> y;
		g[x].push_back(y);
		g[y].push_back(x);
	}
	dfs(1, 0);
	memset(seen, 0, sizeof seen);
	vector < vector <int> > ans;
	for(int i=1; i<=n; i++) if(mark[i]) {
		dfs1(i, i);
		for(int v : g[i]) {
			if(!vis[v] && seen[v] == i) {
				res.clear();
				res.push_back(i);
				vis[i] = 1;
				vis_list.push_back(i);
				dfs2(v, i);
				ans.push_back(res);
			}
		}
		for(int e : vis_list) vis[e] = 0;
	}
	cout << ans.size() << endl;
	for(auto con : ans) {
		for(int e : con) cout << e << " ";
		cout << endl;
	}

	return 0;
}