#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;

const int maxn = 5e5 + 5;
const int maxm = 5e5 + 5;

struct edge { int to, nxt; } e[maxm<<1];
int tot = 1, head[maxn];
inline void add(int u, int v) {
	e[++tot].to = v;
	e[tot].nxt = head[u];
	head[u] = tot;
}

struct Edge { int u, v; } E[maxm];

int n, m, cnt, top, dfncnt;
int low[maxn], dfn[maxn], stk[maxn], scc[maxn], in[maxn];
bool vis[maxn];
vector<int> s[maxn];

void getscc(int u) {
	low[u] = dfn[u] = ++dfncnt;
	stk[++top] = u;
	vis[u] = true;
	for(int i = head[u]; i; i = e[i].nxt) {
		int v = e[i].to;
		if(!dfn[v]) { getscc(v); low[u] = min(low[u], low[v]); }
		else if(vis[v]) low[u] = min(low[u], low[v]);
	}
	vis[u] = false;
	if(dfn[u] == low[u]) {
		int x; cnt++;
		while((x = stk[top--])) {
			s[cnt].push_back(x);
			scc[x] = cnt;
			if(x == u) break;
		}
	}
}

int main() {
	scanf("%d %d", &n, &m);
	for(int i = 1, u, v; i <= m; i++) {
		scanf("%d %d", &u, &v);
		add(u+1, v+1);
		E[i] = { u+1, v+1 };
	}
	for(int i = 1; i <= n; i++)
		if(!dfn[i]) getscc(i);

	queue<int> q;
    for(int i = 1; i <= m; i++) if(scc[E[i].u] != scc[E[i].v]) in[scc[E[i].v]]++;
	for(int i = 1; i <= cnt; i++) if(!in[i]) q.push(i);

	printf("%d\n", cnt);
	while(!q.empty()) {
		int u = q.front(); q.pop();
		printf("%u", s[u].size());
		for(int x : s[u]) printf(" %d", x-1);
		putchar('\n');
		for(int x : s[u]) for(int i = head[x]; i; i = e[i].nxt) {
			int v = scc[e[i].to];
			if(u == v) continue;
			in[v]--;
			if(!in[v]) q.push(v);
		}
	}
	return 0;
}