#include <fstream>

using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
struct nod
{
    int val;
    nod *urm;
};
typedef nod *pnod;
pnod v[100003],p,q[100003];
int ind[100003],lind[100003];
int s[100003],sf;
int n;
bool instack[100003];
int minim(int a,int b)
{
    if(a>b)
        return b;
    return a;
}
void ad(int x,int y)
{
    p=new nod;
    p->val=y;
    p->urm=v[x]->urm;
    v[x]->urm=p;
}
void qad(int x,int y)
{
    p=new nod;
    p->val=y;
    p->urm=q[x]->urm;
    q[x]->urm=p;
}
int index,nr,o,ss;
void tarjan(int cur)
{
    ind[cur]=index;
    lind[cur]=index;
    instack[cur]=1;
    ss+=1;
    s[ss]=cur;
    index+=1;
    pnod p;
    p=v[cur]->urm;
    while(p)
    {
        if(ind[p->val]==0)
        {
            tarjan(p->val);
            lind[cur]=minim(lind[cur],lind[p->val]);
        }

        else
        {
            if(instack[p->val]==1)
                lind[cur]=minim(lind[cur],lind[p->val]);
        }
        p=p->urm;
    }
    if(lind[cur]==ind[cur])
    {
        nr+=1;
        while(s[ss]!=cur)
        {
            o=s[ss];
            qad(nr,o);
            ss-=1;
            instack[o]=0;
        }
        qad(nr,cur);
        instack[cur]=0;
        ss-=1;
        //g<<'\n';
    }
}
int main()
{
    int i,m,x,y;
    f>>n;
    for(i=1;i<=n;i++)
    {
        v[i]=new nod;
        v[i]->urm=0;
        q[i]=new nod;
        q[i]->urm=0;
    }
    f>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        ad(x,y);
    }
    for(i=1;i<=n;i++)
    {
        if(ind[i]==0)
        {
            index=1;
            ss=0;
            tarjan(i);
        }
    }
    g<<nr<<'\n';
    for(i=1;i<=nr;i++)
    {
        p=q[i]->urm;
        while(p)
        {
            g<<p->val<<" ";
            p=p->urm;
        }
        g<<'\n';
    }
    f.close();
    g.close();
    return 0;
}