#include <vector>
#include <cstring>
#include <fstream>
#include <algorithm>

#define NMAX 100010

using std::vector;
using std::random_shuffle;

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

int n, m;
vector<int> ad1[NMAX];
vector<int> ad2[NMAX];

bool done[NMAX];
bool plus[NMAX];
bool minus[NMAX];

int nrComp;
vector<int> comp[NMAX];

void dfs1(int node) {
    plus[node] = true;
    for (int i = 0; i < (int) ad1[node].size(); i++)
        if (!plus[ad1[node][i]])
            dfs1(ad1[node][i]);
}

void dfs2(int node) {
    minus[node] = true;
    for (int i = 0; i < (int) ad2[node].size(); i++)
        if (!minus[ad2[node][i]])
            dfs2(ad2[node][i]);
}

void start(int src) {
    memset(plus, false, sizeof(plus));
    memset(minus, false, sizeof(minus));

    dfs1(src);
    dfs2(src);

    for (int i = 1; i <= n; i++)
        if (plus[i] && minus[i]) {
            done[i] = true;
            comp[nrComp].push_back(i);
        }
    nrComp++;
}

int main() {
    fin >> n >> m;
    for (int i = 0; i < m; i++) {
        int x, y;
        fin >> x >> y;

        ad1[x].push_back(y);
        ad2[y].push_back(x);
    }

    for (int i = 1; i <= n; i++)
        if (!done[i])
            start(i);

    fout << nrComp << '\n';
    for (int i = 0; i < nrComp; i++) {
        for (int j = 0; j < (int) comp[i].size(); j++)
            fout << comp[i][j] << ' ';
        fout << '\n';
    }

    fout.close();
    return 0;
}