#include <bits/stdc++.h>

using namespace std;

ifstream in("ctc.in");
ofstream out("ctc.out");

const int N = 1e5 + 5;

int n, m;

vector <int> g[N], inv[N];

int vis[N], comp[N];

vector <int> ord;

void dfs(int nod)
{
    if(vis[nod])
        return;
    vis[nod] = 1;
    for(auto it:g[nod])
    {
            dfs(it);
    }
    ord.push_back(nod);
}

int cnt;

void dfss(int nod, int nr)
{
    if(comp[nod]) return;
    comp[nod] = nr;
    for(auto it:inv[nod])
    {
        dfss(it, nr);
    }
}

int main()
{
    in >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;
        g[x].push_back(y);
        inv[y].push_back(x);
    }
    for(int i = 1; i <= n; i++)
    {
        if(!vis[i])
            dfs(i);
    }
    reverse(ord.begin(), ord.end());
    for(auto it:ord)
    {
        if(!comp[it])
        {
            dfss(it, ++cnt);
        }
    }
    out << cnt << '\n';
    for(int i = 1; i <= cnt; i++)
    {
        for(int j = 1;  j <= n; j++)
        {
            if(comp[j] == i)
                out << j << ' ';
        }
        out << '\n';
    }
    return 0;
}