#include <bits/stdc++.h>
using namespace std;
ifstream fi("ctc.in");
ofstream fo("ctc.out");

const int NMAX = 1e5 + 5;

vector <int> G[NMAX], H[NMAX];
vector <int> p[NMAX];
int comp[NMAX];
int n, m;
bool vizg[NMAX], vizh[NMAX];
int nr;

void dfsG(int nod)
{
    vizg[nod] = 1;
    for (auto v: G[nod])
    {
        if (!comp[v] && !vizg[v])
            dfsG(v);
    }
}

void dfsH(int nod)
{
    vizh[nod] = 1;
    for (auto v: H[nod])
    {
        if (!comp[v] && !vizh[v])
            dfsH(v);
    }
}

int main()
{
    fi >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int u, v;
        fi >> u >> v;
        G[u].push_back(v);
        H[v].push_back(u);
    }

    for (int i = 1; i <= n; i++)
    {
        if (!comp[i])
        {
            nr++;
            dfsG(i);
            dfsH(i);

            for (int j = 1; j <= n; j++)
                if (!comp[j] && vizg[j] && vizh[j])
                {
                    comp[j] = nr;
                    p[nr].push_back(j);
                }
            memset(vizh, 0, sizeof(vizh));
            memset(vizg, 0, sizeof(vizg));
        }
    }

    fo << nr << "\n";

    for (int i = 1; i <= nr; i++)
    {
        for (auto x: p[i])
            fo << x << " ";
        fo << "\n";
    }

    return 0;
}