#include <cstdio>
#include <deque>
using namespace std;
deque<int>adj[100023],sol[100023],stiva;
bool vis[100023],ins[100023];
int niv[100023],low[100023];
int n,m,comp;
void tarjan(int nod,int ind)
{
    vis[nod]=1;
    niv[nod]=ind+1;
    low[nod]=niv[nod];
    stiva.push_back(nod);
    ins[nod]=1;
    deque<int>::iterator it;
    for(it=adj[nod].begin();it!=adj[nod].end();++it)
    {
        if(vis[*it]==0) tarjan(*it,ind+1);
        if(ins[*it]==1&&low[nod]>low[*it]) low[nod]=low[*it];
    }
    if(niv[nod]==low[nod])
    {
        ++comp;
        while(1)
        {
            int vcn=stiva.back();
            ins[vcn]=0;
            sol[comp].push_back(vcn);
            if(vcn==nod)
            {
                stiva.pop_back();
                break;
            }
            stiva.pop_back();
        }
    }
}
int main()
{
    freopen ("ctc.in","r",stdin);
    freopen ("ctc.out","w",stdout);
    int x1,x2;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&x1,&x2);
        adj[x1].push_back(x2);
    }
    for(int i=1;i<=n;i++)
    {
        if(vis[i]==0) tarjan(i,0);
    }
    printf("%d\n",comp);
    for(int i=1;i<=comp;i++)
    {
        deque<int>::iterator it;
        for(it=sol[i].begin();it!=sol[i].end();++it) printf("%d ",*it);
        printf("\n");
    }
}