#include <iostream>
#include <cstdio>
#include <vector>
#include <bitset>
#include <stack>
#include <algorithm>

using namespace std;

const int NMax = 100005;

vector < int > G[NMax], Gt[NMax], cmp[NMax];
bitset < NMax > viz;
stack < int > st;
int N, M, ctc;

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

void DFS(int nod)
{
    viz[nod] = 1;
    vector < int > ::iterator it;
    for(it=G[nod].begin(); it!=G[nod].end(); ++it)
    {
        if(!viz[*it])
        {
            DFS(*it);
        }
    }

    st.push(nod);
}

void DFSt(int nod)
{
    viz[nod] = 1;
    cmp[ctc].push_back(nod);
    vector < int > ::iterator it;
    for(it=Gt[nod].begin(); it!=Gt[nod].end();++it)
    {
        if(!viz[*it])
            DFSt(*it);
    }
}

void Print()
{
    printf("%d\n", ctc);

    for(int i=0; i<ctc; ++i)
    {
        //printf("%d ", cmp[i].size());
        sort(cmp[i].begin(), cmp[i].end());
        for(int j=0; j<cmp[i].size(); ++j)
            printf("%d ", cmp[i][j]);

        printf("\n");
    }
}

int main()
{
//    freopen("retele.in", "r", stdin);
//    freopen("retele.out", "w", stdout);

    freopen("ctc.in", "r", stdin);
    freopen("ctc.out", "w", stdout);

    Read();

    for(int i=1; i<=N; ++i)
    {
        if(!viz[i])
            DFS(i);
    }

    viz.reset();

    while(!st.empty())
    {
        int vf = st.top();
        if(!viz[vf])
        {
            DFSt(vf);
            ++ctc;
        }

        st.pop();
    }

    Print();
    return 0;
}