#include<iostream.h>
#include<fstream.h>
#include<stdlib.h>
#define N 100001
#define M 200001
typedef struct nod
{long info;
struct nod *leg;}Nod,*list;
list s,q;
long n,m,a[M],b[M],deg[N]={0},*g[N],k,i,j,t,ind=0,c[N]={0},l[N],nr,r;

void push(list &q,long x)
{Nod *p=new Nod;
p->info=x;
p->leg=q;
q=p;}

long pop(list &q)
{Nod *p=q->leg;
long t=q->info;
free(q);
q=p;
return t;}

int apartine(list &q,long x)
{Nod *p;
for(p=q;p!=NULL;p=p->leg)
if(p->info==x)
      return 1;
return 0;}

void tarjan(long i,long *nr,long *ind)
{long k,j,r;
push(s,i);
c[i]=(*ind);
l[i]=(*ind)++;
for(j=0;j<deg[i];j++)
if(c[g[i][j]]==0)
       {tarjan(g[i][j],nr,ind);
       if(l[i]>l[g[i][j]])
              l[i]=l[g[i][j]];}
else
       if(apartine(s,g[i][j])==1&&l[i]>c[g[i][j]])
              l[i]=c[g[i][j]];
if(c[i]==l[i])
       {k=0;
       (*nr)++;
       while(s!=NULL)
              {r=pop(s);
              if(apartine(q,r)==0)
                    if(r!=i)
                           push(q,r);
                    else
                           break;
              else
                    break;}
       if(apartine(q,i)==0)
              push(q,i);
       if(pop(q)==0)
              (*nr)--;
       push(q,0);}}

int main()
{ifstream f1("ctc.in");
ofstream f2("ctc.out");
f1>>n>>m;
for(k=1;k<=m;k++)
       {f1>>a[k]>>b[k];
       deg[a[k]]++;}
for(i=1;i<=n;i++)
       {g[i]=(long*)malloc(deg[i]*sizeof(long));
       deg[i]=0;}
for(j=1;j<=m;j++)
       g[a[j]][deg[a[j]]++]=b[j];
ind=0;
nr=0;
q=s=NULL;
for(i=1;i<=n;i++)
if(c[i]==0)
       tarjan(i,&nr,&ind);
f2<<nr<<endl;
for(j=1;j<=nr;j++)
       {r=pop(q);
       while(r!=0)
              {f2<<r<<" ";
              r=pop(q);}
       f2<<endl;}
f1.close();
f2.close();
return 0;}