#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
using namespace std;

vector<vector<int>> adjl;
vector<int> level, low;
stack<int> t;
vector<bool> popped;
vector<vector<int>> sccs;

void dfs(int u, int lvl)
{
	low[u] = level[u] = lvl;
	t.push(u);
	for (auto v: adjl[u]) {
		if (popped[v]) {
			continue;
		}
		if (level[v] == -1) {
			dfs(v, lvl+1);
		}
		low[u] = min(low[u], low[v]);
	}
	if (low[u] == level[u]) {
		vector<int> scc;
		int top;
		do {
			top = t.top();
			t.pop();
			popped[top] = true;
			scc.push_back(top);
		} while (top != u);
		sccs.push_back(scc);
	}
}

int main()
{
	ios::sync_with_stdio(false);
	freopen("ctc.in", "r", stdin);
	freopen("ctc.out", "w", stdout);
	int n, m;
	cin >> n >> m;
	adjl.resize(n);
	for (int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v;
		u--, v--;
		adjl[u].push_back(v);
	}
	level.assign(n, -1);
	low.resize(n);
	popped.resize(n);
	for (int i = 0; i < n; i++) {
		if (level[i] == -1) {
			dfs(i, 0);
		}
	}
	printf("%d\n", sccs.size());
	for (auto scc: sccs) {
		for (auto u: scc) {
			printf("%d ", u+1);
		}
		printf("\n");
	}
	return 0;
}