#include <bits/stdc++.h>
using namespace std;
constexpr int inf_int=numeric_limits<int>::max();
constexpr int max_n=500000;
vector<int>g[max_n+1];
int low[max_n+1];
int stk[max_n+1],dfncnt;
vector<vector<int> >comps;
int dfsa(const int u){
	const int dfu=low[u]=++dfncnt;
	stk[dfu]=u;
	int lwu=dfu;
	for(const int&v:g[u]){
		if(low[v]){
			if(low[v]<lwu)
				lwu=low[v];
			continue;
		}
		const int lwv=dfsa(v);
		if(lwv<lwu)
			lwu=lwv;
	}
	if(dfu==lwu){
		vector<int>vec;
		for(int v; (v=stk[dfncnt])!=u; --dfncnt)
			vec.emplace_back(v),low[v]=inf_int;
		vec.emplace_back(u),low[u]=inf_int,--dfncnt;
		comps.emplace_back(vec);
	}
	return low[u]=lwu;
}
int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=1,u,v; i<=m; ++i){
		scanf("%d%d",&u,&v);
		g[u].emplace_back(v);
	}
	for(int i=0; i<n; ++i)
		if(!low[i])
			dfsa(i);
	printf("%zd\n",comps.size());
	for(decltype(comps)::const_reverse_iterator it=comps.crbegin(),ed=comps.crend(); it!=ed; ++it){
		printf("%zd",it->size());
		for(const int&x:*it)
			printf(" %d",x);
		putchar('\n');
	}
	return 0;
}