#include<iostream>
#include<fstream>
using namespace std;
long n,id=1,ctc=0;
int stiva[100010],vf=0,ids[100010],low[100010],nrvecini[100010],nrnctc[100010];
bool peStiva[100010];
struct vecini{
    long vec,cost;
    vecini *urm;
}*v[100010],*ct[100010];

void citire();
void rezolvare();
void afisare();

int main(){
    citire();
    rezolvare();
}
void push(int x){
    stiva[++vf]=x;
}
long pop(){
    return stiva[vf--];
}
void adaugare(vecini *&p,long vec){
    vecini *q=new vecini;
    q->vec=vec;
    q->urm=p;
    p=q;
}
void citire(){
    ifstream f("ctc.in");
    long i,x,y,m; f>>n>>m;
    for(i=1;i<=m;i++){
        f>>x>>y;
        adaugare(v[x],y);
        nrvecini[x]++;
    }
    f.close();
}
void dfs(long s){
    push(s);
    peStiva[s]=1;
    ids[s]=low[s]=id++;

    vecini *nvp=v[s];
    long nv,no,i;

    for(i=1;i<=nrvecini[s];i++){
        nv=nvp->vec;
        if(ids[nv]==-1) dfs(nv);
        if(peStiva[nv]) low[s]=min(low[s],low[nv]);
        nvp=nvp->urm;
    }
    if(ids[s]==low[s]){
        do{
            no=pop();
            peStiva[no]=0;
            low[no]=ids[s];
            adaugare(ct[ctc+1],no);
            nrnctc[ctc+1]++;
        }while(no!=s);
        ctc++;
    }
}
void rezolvare(){
    long i,j; for(i=1;i<=n;i++) ids[i]=-1;
    for(i=1;i<=n;i++)
        if(ids[i]==-1) dfs(i);
    ofstream o("ctc.out");
    o<<ctc<<endl;
    for(i=1;i<=ctc;i++){
        vecini *c=ct[i];
        for(j=1;j<=nrnctc[i];j++){
            o<<c->vec<<" ";
            c=c->urm;
        }
        o<<endl;
    }
    o.close();
}