#include <cstdio>
#include <queue>
#include <span>
#include <stack>
#include <vector>

struct TarjanScc {
    std::vector<std::vector<size_t>> adj, sccs;
    std::vector<size_t> dfn, low;
    std::stack<size_t> stk;
    std::vector<bool> on_stack;
    size_t dfs_clock;
    TarjanScc(std::span<std::pair<size_t, size_t>> edges, size_t n)
        : adj(n), dfn(n), low(n), on_stack(n), dfs_clock(0) {
        for (auto [u, v]: edges) {
            adj[u].emplace_back(v);
        }
        for (size_t u = 0; u < n; ++u) {
            if (!dfn[u]) {
                find_sccs(u);
            }
        }
    }

private:
    void find_sccs(size_t u) {
        dfn[u] = low[u] = ++dfs_clock;
        stk.push(u);
        on_stack[u] = true;
        for (auto v: adj[u]) {
            if (!dfn[v]) {
                find_sccs(v);
                low[u] = std::min(low[u], low[v]);
            } else if (on_stack[v]) {
                low[u] = std::min(low[u], dfn[v]);
            }
        }
        if (dfn[u] == low[u]) {
            std::vector<size_t> scc;
            while (true) {
                auto v = stk.top();
                stk.pop();
                on_stack[v] = false;
                scc.push_back(v);
                if (v == u) {
                    break;
                }
            }
            sccs.emplace_back(std::move(scc));
        }
    }
};

int main() {
    size_t n, m;
    scanf("%zd%zd", &n, &m);
    std::vector<std::pair<size_t, size_t>> edges(m);
    for (auto &[u, v]: edges) {
        scanf("%zu%zu", &u, &v);
    }
    auto sccs = TarjanScc(edges, n).sccs;
    std::vector<std::vector<size_t>> adj(sccs.size());
    std::vector<size_t> degree(sccs.size(), 0), sccno(n, -1);
    for (size_t i = 0; i < sccs.size(); ++i) {
        for (auto u: sccs[i]) {
            sccno[u] = i;
        }
    }
    for (auto [u, v]: edges) {
        if (sccno[u] != sccno[v]) {
            adj[sccno[u]].emplace_back(sccno[v]);
        }
    }
    std::queue<size_t> q;
    for (size_t i = 0; i < sccs.size(); ++i) {
        if (!degree[i]) {
            q.push(i);
        }
    }
    printf("%zu\n", sccs.size());
    while (!q.empty()) {
        auto u = q.front();
        q.pop();
        printf("%zu ", sccs[u].size());
        for (auto x: sccs[u]) {
            printf("%zu ", x);
        }
        puts("");
        for (auto v: adj[u]) {
            if (!--degree[v]) {
                q.push(v);
            }
        }
    }
    return 0;
}