#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int NMAX = 100010;

int N, M, X, Y, TopSort[NMAX];
bool Used[NMAX];
vector<int> G[NMAX], GT[NMAX], CrtComp;
vector<vector<int> > Comp;

void DFP(int Node)
{
    Used[Node] = 1;
    for(vector<int> :: iterator it = G[Node].begin(); it != G[Node].end(); ++ it)
        if(!Used[*it])
            DFP(*it);
    TopSort[++ TopSort[0]] = Node;
}

void DFM(int Node)
{
    Used[Node] = 0;
    CrtComp.push_back(Node);
    for(vector<int> :: iterator it = GT[Node].begin(); it != GT[Node].end(); ++ it)
        if(Used[*it])
            DFM(*it);
}

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

    scanf("%i %i", &N, &M);
    for(int i = 1; i <= M; ++ i)
    {
        scanf("%i %i", &X, &Y);
        G[X].push_back(Y);
        GT[Y].push_back(X);
    }

    for(int i = 1; i <= N; ++ i)
        if(!Used[i])
            DFP(i);
    reverse(TopSort + 1, TopSort + N + 1);
    for(int i = 1; i <= N; ++ i)
        if(Used[ TopSort[i] ])
        {
            CrtComp.clear();
            DFM(TopSort[i]);
            Comp.push_back(CrtComp);
        }

    printf("%i\n", Comp.size());
    for(int i = 0; i < Comp.size(); ++ i)
    {
        for(int j = 0; j < Comp[i].size(); ++ j) printf("%i ", Comp[i][j]);
        printf("\n");
    }
}