#include <fstream>
#include <vector>
#include <queue>
#define NMAX 10005
using namespace std;

ifstream fin("ctc.in");
ofstream fout("ctc.out");

vector <int> M[NMAX], T[NMAX], S, R[NMAX];
int n, m, result, visited[NMAX], mark[NMAX];

void DFS(int node, vector<int> G[NMAX])
{
    int i;
    visited[node] = 1;
    for(i = 0; i < G[node].size(); i++)
        if(visited[G[node][i]] == 0)
        DFS(M[node][i], G);
    S.push_back(node);
}
void DFT(int node)
{
    /*int i, v;
    queue <int> Q;
    Q.push(node);
    mark[node] = result;
    while(!Q.empty())
    {
        v = Q.front();
        Q.pop();
        for(i = 0; i < T[node].size(); i++)
            if(mark[T[node][i]] == 0)
            {
                mark[T[node][i]] = result;
                Q.push(T[node][i]);
            }
    }*/

    int i;
    mark[node] = result;
    R[result].push_back(node);
    for(i = 0; i < T[node].size(); i++)
        if(mark[T[node][i]] == 0)
        {
            DFT(T[node][i]);
        }
}
int main()
{
    int i, j, x, y;
    fin >> n >> m;
    for(i = 1; i <= m; i++)
    {
        fin >> x >> y;
        M[x].push_back(y);
        T[y].push_back(x);
    }
    /*for(i = 1; i <= n; i++)
    {
        fout << i << ": ";
        for(j = 0; j < T[i].size(); j++)
            fout << T[i][j]<< ' ';
        fout << '\n';
    }*/
    for(i = 1; i <= n; i++)
        if(visited[i] == 0)
        DFS(i, M);
    for(i = n - 1; i > 0; i--)
        if(mark[S[i]] == 0)
        {
            ++result;
            DFT(S[i]);
        }
    fout << result<< '\n';
    for(i = 1; i <= result; i++)
    {
        for(j = 0; j < R[i].size(); j++)
            fout << R[i][j] << ' ';
        fout << '\n';
    }
    return 0;
}