#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
vector<int> graf[100001];
vector<int> grafTranspus[100001];
vector<int> componente[100001];
int viz[100001];
int ordine[100001];
int nrOrdine;
int nrComponente;
void dfs(int nod)
{
viz[nod]=1;
for (int i=0;i<graf[nod].size();i++)
{
int vecin=graf[nod][i];
if (viz[vecin]==0)
dfs(vecin);
}
nrOrdine++;
ordine[nrOrdine]=nod;
}
void dfsTranspus(int nod)
{
viz[nod]=2;
componente[nrComponente].push_back(nod);
for (int i=0;i<grafTranspus[nod].size();i++)
{
int vecin=grafTranspus[nod][i];
if (viz[vecin]==1)
dfsTranspus(vecin);
}
}
int main()
{
int n,m;
fin>>n>>m;
for (int i=1;i<=m;i++)
{
int x,y;
fin>>x>>y;
graf[x].push_back(y);
grafTranspus[y].push_back(x);
}
for (int i=1;i<=n;i++)
if (viz[i]==0)
dfs(i);
for (int i=n;i>=1;i--)
{
int nod=ordine[i];
if (viz[nod]==1)
{
nrComponente++;
dfsTranspus(nod);
}
}
fout<<nrComponente<<"\n";
for (int i=1;i<=nrComponente;i++)
{
for (int j=0;j<componente[i].size();j++)
fout<<componente[i][j]<<" ";
fout<<"\n";
}
return 0;
}