#include <fstream>
#include <vector>
#include <stack>

using namespace std;

const char InFile[]="ctc.in";
const char OutFile[]="ctc.out";
const int MaxN=100111;

ifstream fin(InFile);
ofstream fout(OutFile);

int N,M,x,y,V[MaxN],low[MaxN],niv;
stack<int> S;
vector<int> G[MaxN],c;
vector< vector<int> > C;

void DFS(int nod)
{
	++niv;
	S.push(nod);
	V[nod]=low[nod]=niv;
	for(vector<int>::iterator it=G[nod].begin();it!=G[nod].end();++it)
	{
		if(!V[*it])
		{
			DFS(*it);
			low[nod]=min(low[nod],low[*it]);
		}
		else
		{
			low[nod]=min(low[nod],low[*it]);
		}
	}
	
	if(low[nod]==V[nod])
	{
		c.clear();
		while(1)
		{
			int x=S.top();
			S.pop();
			c.push_back(x);
			if(x==nod)
			{
				break;
			}
		}
		C.push_back(c);
	}
}

int main()
{
	fin>>N>>M;
	for(register int i=0;i<M;++i)
	{
		fin>>x>>y;
		G[x].push_back(y);
	}
	fin.close();
	
	for(register int i=1;i<=N;++i)
	{
		if(!V[i])
		{
			DFS(i);
		}
	}
	
	fout<<C.size()<<"\n";
	for(vector< vector<int> >::iterator it=C.begin();it!=C.end();++it)
	{
		for(vector<int>::iterator it2=it->begin();it2!=it->end();++it2)
		{
			fout<<*it2<<" ";
		}
		fout<<"\n";
	}
	fout.close();
	return 0;
}