#include <fstream>
#include <vector>
#include <queue>
#define NMAX 100005
#define MMAX 200005

using namespace std;
ifstream in("ctc.in");
ofstream out("ctc.out");

vector <int> adj[NMAX];
vector <int> rev_adj[NMAX];
vector <int> cnx[NMAX];
int viz[NMAX], cmp_cnx;
bool cmp[NMAX];

void dfs1(int node, int start)
{
    viz[node] = start;
    int i;
    for (i = 0; i < adj[node].size(); ++i)
    {
        int vecin = adj[node][i];
        if (viz[vecin] != start && cmp[vecin] == 0)
        {
            dfs1(vecin, start);
        }
    }
}

void dfs2(int node, int start)
{
    cnx[cmp_cnx].push_back(node);
    cmp[node] = 1;
    int i;
    for (i = 0; i < rev_adj[node].size(); ++i)
    {
        int vecin = rev_adj[node][i];
        if (viz[vecin] == start && cmp[vecin] == 0)
        {
            dfs2(vecin, start);
        }
    }
}

int main()
{
    int n, m, i, j, a, b;
    in >> n >> m;
    for (i = 1; i <= m; ++i)
    {
        in >> a >> b;
        adj[a].push_back(b);
        rev_adj[b].push_back(a);
    }

    //dau valoarea infinit tuturor nodurilor la inceput, iar apoi le dau 1 la prima parcurgere si le scad 1 la a 2 a parcurgere

    for (i = 1; i <= n; ++i)
    {
        if (viz[i] != i && cmp[i] == 0)
        {
            ++cmp_cnx;
            dfs1(i, i);
            dfs2(i, i);
        }
    }

    out << cmp_cnx << '\n';
    for (i = 1; i <= cmp_cnx; ++i)
    {
        for (j = 0; j < cnx[i].size(); ++j)
            out << cnx[i][j] << " ";
        out << '\n';
    }
    return 0;
}