#include <algorithm>
#include <fstream>
#include <vector>

using namespace std;

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

const int nmax = 100005;
int n, m, fr[nmax], ind;
vector<int> s, v[nmax], v2[nmax], ctc[nmax];

void sortop(int nod)
{
    fr[nod] = 1;
    for(auto x : v[nod])
        if(!fr[x])
            sortop(x);

    s.push_back(nod);
}

void dfs(int nod)
{
    fr[nod] = 1;
    for(auto x : v2[nod])
        if(!fr[x])
            dfs(x);

    ctc[ind].push_back(nod);
}

int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; i ++)
    {
        int x, y; f >> x >> y;
        v[x].push_back(y);
        v2[y].push_back(x);
    }

    for(int i = 1; i <= n; i ++)
        if(!fr[i])
            sortop(i);

    reverse(s.begin(), s.end());

    for(int i = 1; i <= n; i ++)
        fr[i] = 0;

    for(int i = 0; i < s.size(); i ++)
        if(!fr[s[i]])
            ind ++, dfs(s[i]);

    g << ind << '\n';
    for(int i = 1; i <= ind; i ++, g << '\n')
        for(auto x : ctc[i])
            g << x << " ";
    return 0;
}