#include <bits/stdc++.h>

using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
const int nMax = 100003;
vector <int> Graf[nMax], ans[nMax], GrafT[nMax];
int St[nMax], k;
int comp = 0;
bool viz[nMax];
inline void Dfs(int nod) {
    viz[nod] = 1;
    for(const auto &i : Graf[nod]) {
        if(!viz[i]) {
            Dfs(i);
        }
    }
    St[++k] = nod;
}
inline void Ctc(int nod) {
    ans[comp].push_back(nod);
    viz[nod] = 1;
    for(const auto &i : GrafT[nod]) {
        if(!viz[i]) {
            Ctc(i);
        }
    }
}
int main()
{
    int n, m, x, y;
    f >> n >> m;
    for(int i = 1; i <= m; i++) {
        f >> x >> y;
        Graf[x].push_back(y);
        GrafT[y].push_back(x);
    }
    for(int i = 1; i <= n; i++) {
        if(!viz[i]) {
            Dfs(i);
        }
    }
    memset(viz, 0, sizeof viz);
    for(int i = k; i >= 1; i--) {
        if(!viz[St[i]]) {
            comp++;
            Ctc(St[i]);
        }
    }
    g << comp << "\n";
    for(int i = 1; i <= n; i++) {
        for(const auto &v : ans[i]) {
            g << v << " ";
        }
        g << "\n";
    }
    return 0;
}