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

using namespace std;

#define NMAX 100005

vector<int> g[NMAX], t[NMAX], sol[NMAX];
vector<int> nods;
bitset<NMAX> visited;
int n,m,nr=0;

void dfs(int nod)
{
    visited[nod] = 1;
    for (auto &i : g[nod])
        if (!visited[i])
            dfs(i);
    nods.push_back(nod);
}

void dfst(int nod)
{
    visited[nod]=0;
    sol[nr].push_back(nod);
    for (auto &i : t[nod])
        if (visited[i])
            dfst(i);
}

int main()
{
    ifstream fin("ctc.in");
    fin >> n >> m;
    int x,y;
    for (int i = 0; i < m; i++)
    {
        fin >> x >> y;
        --x;--y;
        g[x].push_back(y);
        t[y].push_back(x);
    }
    
    for (int i = 0; i<n; i++)
        if (!visited[i])
            dfs(i);
    
    reverse(nods.begin(), nods.end());
    for (auto &i : nods)
    {
        if (!visited[i])
            continue;
        dfst(i);
        ++nr;
    }
    
    ofstream fout("ctc.out");
    fout << nr << endl;
    for (int i = 0;i<nr; i++)
    {
        for(auto &j : sol[i])
            fout << j+1 << " ";
        fout << endl;
    }
    fout.close();
    
    return 0;
}