#include <iostream>
#include <stdio.h>
#include <vector>
#include <stdio.h>
#include <stack>
#include <cstring>
#define NMax 100005
using namespace std;
vector<int> Graf[NMax],GrafT[NMax],Sol[NMax];
int N,M,x,y,nrcomp;
bool mark[NMax];
stack<int> Stiva;

void Read()
{
    scanf("%d%d",&N,&M);
    for(int i=1;i<=M;i++)
    {
        scanf("%d%d",&x,&y);
        Graf[x].push_back(y);
        GrafT[y].push_back(x);
    }
}

void DFS1(int nod)
{
    mark[nod]=true;
    for(vector<int>::iterator it=Graf[nod].begin();it!=Graf[nod].end();it++)
        if(mark[*it]==false)
        DFS1(*it);
    Stiva.push(nod);
}

void DFS2(int nod)
{
    mark[nod]=true;
    Sol[nrcomp].push_back(nod);
    for(vector<int>::iterator it=GrafT[nod].begin();it!=GrafT[nod].end();it++)
        if(mark[*it]==false)
        DFS2(*it);
}

void Solve()
{
    for(int i=1;i<=N;i++)
        if(mark[i]==false)
        DFS1(i);
    memset(mark,false,sizeof(mark));

    while(Stiva.empty()==false)
    {
        int nod=Stiva.top();
        Stiva.pop();
        if(mark[nod]==false)
        {
            nrcomp++;
            DFS2(nod);
        }
    }
}

void Write()
{
    printf("%d\n",nrcomp);
    for(int i=1;i<=N;i++)
    {
        for(vector<int>::iterator it=Sol[i].begin();it!=Sol[i].end();it++)
            printf("%d ",*it);
        printf("\n");
    }
}

int main()
{
    freopen("ctc.in","r",stdin);
    freopen("ctc.out","w",stdout);
    Read();
    Solve();
    Write();
}