#include<fstream>
#include<vector> 

using namespace std; 

ifstream in("ctc.in"); 
ofstream out("ctc.out"); 

#define pb push_back 
#define NMAX 100001

vector< int > G[NMAX], Gt[NMAX], sol[NMAX]; 

int N, M, timp=0, viz[NMAX], final[NMAX], ordine[NMAX], nr=0, d[NMAX] ; 

void DFS(int nod) 
{
	//d[nod] = timp = timp + 1;
	for(vector< int > :: iterator it = G[nod].begin(); it != G[nod].end(); ++it) 
		if(!viz[*it]) 
			{
				viz[*it] = 1; 
				DFS(*it); 
						}
		
		final[nod] = timp = timp + 1; 
}

void DFSt(int nod) 
{
	sol[nr].pb(nod); 
	
	for(vector< int > :: iterator it = Gt[nod].begin(); it != Gt[nod].end(); ++it) 
		if(!viz[*it]) 
		{
			viz[*it] = 1;
            DFSt(*it); 
		}
}		
			
	
int main() 
{
	int i, j, x, y, k;
	in >> N >> M; 
	
	for(i = 1; i <= M; i++) 
	{
		in >> x >> y; 
		G[x].pb(y); 
		Gt[y].pb(x); 
	}
	
	for(i = 1; i <= N; i++) 
		viz[i] = 0; 
	
	for(i = 1; i <= N; i++) 
		if(!viz[i]) 
			{
				viz[i] = 1; 
				DFS(i);
		}
		
		for(i = 1; i <= N; i++) 
		{
			k = final[i]; 
			ordine[N - k + 1] = i; 
		}
		
		for(i = 1; i <= N; i++) 
			viz[i] = 0; 
		
		for(i = 1; i <= N; i++) 
		{
			k = ordine[i];
			if(!viz[k]) 
				{
					++nr; 
					DFSt(k);
			}
		}			
			
		out << nr << '\n'; 
	
			for(i = 1; i <= nr; ++i) 
			{
				for(j = 0; j < sol[i].size(); ++j)
					out << sol[i][j] << " "; 
				
				out << '\n'; 
			}
			
			return 0; 
}