#include<iostream.h>
#include<fstream.h>
#include<stdlib.h>
#define N 100001
#define M 200001
typedef struct stack
{long st[N],sp;};
stack s,q;
long n,m,a[M],b[M],deg[N]={0},*g[N],k,i,j,t,index=0,*d[N],c[N]={0},l[N],e[N],nr;

void push(stack &s,long x)
{s.st[++s.sp]=x;}

long pop(stack &s)
{return s.st[s.sp--];}

int apartine(stack &s,long x)
{long i;
for(i=1;i<=s.sp;i++)
if(s.st[i]==x)
      return 1;
return 0;}

void tarjan(long *g[N],long deg[N],long i,long *nr,long *index,long e[N],long *d[N])
{long k,j,r;
if(apartine(s,i)==0)
       push(s,i);
c[i]=(*index);
l[i]=(*index)++;
for(j=deg[i]-1;j>=0;j--)
if(c[g[i][j]]==0)
       {tarjan(g,deg,g[i][j],nr,index,e,d);
       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)++;
       d[(*nr)]=(long*)malloc((s.sp+1)*sizeof(long));
       while(s.sp!=0)
              {r=pop(s);
              if(r!=i&&apartine(q,r)==0)
                      {push(q,r);
                      d[(*nr)][++k]=r;}
              else
                      break;}
       if(apartine(q,i)==0)
              {push(q,i);
              d[(*nr)][++k]=i;}
       if(k==0)
              {free(d[*nr]);
              (*nr)--;}
       else
              e[(*nr)]=k;}}

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[b[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[b[j]][deg[b[j]]++]=a[j];
index=0;
nr=0;
s.sp=0;
q.sp=0;
for(i=1;i<=n;i++)
if(c[i]==0)
       tarjan(g,deg,i,&nr,&index,e,d);
f2<<nr<<endl;
for(j=1;j<=nr;j++)
       {for(k=1;k<=e[j];k++)
              f2<<d[j][k]<<" ";
       f2<<endl;}
f1.close();
f2.close();
return 0;}