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

typedef long long ll;
#define pb push_back 
const int N=1e5+3;
int n,m,tim,tot,top,dfn[N],low[N],col[N],sta[N],kx[N],ky[N],in[N];
vector<int>ve[N],ans[N],now[N];
void Dfs(int x)
{
	low[x]=dfn[x]=++tim;sta[++top]=x;
	for(int y:ve[x])
	{
		if(dfn[y]){if(!col[y])low[x]=min(low[x],dfn[y]);continue;}
		Dfs(y);low[x]=min(low[x],low[y]);
	}
	if(dfn[x]==low[x])for(tot++;sta[top+1]!=x;top--)col[sta[top]]=tot;
}
int main()
{
	cin>>n>>m;
	for(int i=1,x,y;i<=m;i++)
		cin>>x>>y,ve[++x].push_back(++y),kx[i]=x,ky[i]=y;
	for(int i=1;i<=n;i++)if(!dfn[i])Dfs(i);
	for(int i=1;i<=n;i++)ans[col[i]].pb(i);
	for(int i=1,x,y;i<=m;i++)
	    if((x=col[kx[i]])!=(y=col[ky[i]]))now[x].pb(y),in[y]++; 
	cout<<tot<<endl;queue<int>q;
	for(int i=1;i<=tot;i++)if(!in[i])q.push(i);
	while(q.size())
	{
		int x=q.front();q.pop();
		cout<<ans[x].size()<<" ";
		for(int z:ans[x])cout<<z-1<<" ";
		cout<<endl;
		for(int y:now[x])if(!--in[y])q.push(y); 
	}
}