#include <bits/stdc++.h>

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