#include <iostream>
#include <fstream>
#include <vector>
#include <unordered_set>

std::vector<std::vector<int>> graph;
std::vector<std::vector<int>> transpose;
std::vector<int> stack;
std::vector<int> visited;
std::vector<int> roots;

void dfs(int node) {
    for (const auto &x: graph[node]) {
        if (!visited[x]) {
            visited[x] = true;
            dfs(x);
        }
    }
    stack.push_back(node);
}

void assign(int node, int root) {
    if (roots[node] == 0) {
        roots[node] = root;
        for (const auto &x: transpose[node]) {
            assign(x, root);
        }
    }
}

int main() {
    std::ifstream input("ctc.in");
    std::ofstream output("ctc.out");

    int n, m;
    input >> n >> m;

    graph.resize(n + 1);
    transpose.resize(n + 1);
    visited.resize(n + 1, false);
    roots.resize(n + 1, 0);
    while (m--) {
        int x, y;
        input >> x >> y;
        graph[x].push_back(y);
        transpose[y].push_back(x);
    }

    for (int i = 1; i <= n; ++i) {
        if (!visited[i]) {
            visited[i] = true;
            dfs(i);
        }
    }

    while (!stack.empty()) {
        assign(stack.back(), stack.back());
        stack.pop_back();
    }

    std::unordered_set<int> set(roots.begin() + 1, roots.end());

    std::vector<std::vector<int>> components(n + 1);
    for (int i = 1; i <= n; ++i) {
        components[roots[i]].push_back(i);
    }
    output << set.size() << '\n';
    for (int i = 1; i <= n; ++i) {
        for (const auto &x: components[i]) output << x << " ";
        if (!components[i].empty()) output << '\n';
    }

    return 0;
}