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

const int kNmax = 100005;

class Task {
 public:
	void solve() {
		read_input();
		print_output(get_result());
	}

 private:
	int n;
	int m;
	vector<int> adj[kNmax];
	vector<int> idx;
	vector<int> low;
	vector<int> parent;
	stack<int> s;
	vector<vector<int>> bccs;
	int t = 0;

	void read_input() {
		ifstream fin("biconex.in");
		fin >> n >> m;
		for (int i = 1, x, y; i <= m; i++) {
			fin >> x >> y;
			adj[x].push_back(y);
			adj[y].push_back(x);
		}
		fin.close();
	}

	void dump(int u, int v) {
		vector<int> bcc;
		int w;

		do {
			w = s.top();
			s.pop();
			bcc.push_back(w);
		} while (w != u);

		bcc.push_back(v);
		bccs.push_back(bcc);
	}

	void dfsBCC(int v) {
		t++;
		idx[v] = t;
		low[v] = t;
		s.push(v);
		int nkids = 0;

		for (int u : adj[v]) 
			if (!idx[u]) {
				nkids++;
				parent[u] = v;
				dfsBCC(u);
				low[v] = min(low[v], low[u]);
				if (low[u] >= idx[v]) 
					dump(u, v);
			}
			else if (u != parent[v])
				low[v] = min(low[v], idx[u]);
	}

	vector<vector<int>> get_result() {
		/*
		TODO: Gasiti nodurile critice ale grafului neorientat stocat cu liste
		de adiacenta in adj.
		*/
		idx.resize(n + 1, 0);
		low.resize(n + 1);
		parent.resize(n + 1, 0);

		for (int i = 1; i <= n; i++)
			if (!idx[i])
				dfsBCC(i);
	
		return bccs;
	}

	void print_output(vector<vector<int>> result) {
		ofstream fout("biconex.out");
		fout << result.size() << '\n';
		for (int i = 0; i < int(result.size()); i++) {
			for (int j = 0; j < int(result[i].size()); j++)
				fout << result[i][j] << ' ';
			fout << '\n';
		}
		fout.close();
	}
};

int main() {
	Task *task = new Task();
	task->solve();
	delete task;
	return 0;
}