#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
const int NMAX = 100005;
long long n, m;
bool vizitat[NMAX];
vector<long long> v[NMAX];
vector<long long> v_inv[NMAX];
vector<long long> solutie;
vector<vector<long long>> ctc;
vector<long long> comp_curenta;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
void parcurgere(long long nod)
{
vizitat[nod] = true;
for(auto next : v[nod])
{
if(!vizitat[next])
parcurgere(next);
}
solutie.push_back(nod);
}
void parcurgere_invers(long long nod)
{
vizitat[nod] = false;
comp_curenta.push_back(nod);
for(auto next : v_inv[nod])
{
if(vizitat[next])
parcurgere_invers(next);
}
}
int main()
{
fin >> n >> m;
long long x, y;
for(long long i = 0; i < m; i++)
{
fin >> x >> y;
v[x].push_back(y);
v_inv[y].push_back(x);
}
for(long long i = 1; i <= n; i++)
{
if(!vizitat[i])
{
parcurgere(i);
}
}
for(int i = (int)solutie.size() - 1; i >= 0; i--)
{
long long nod = solutie[i];
if(vizitat[nod])
{
comp_curenta.clear();
parcurgere_invers(nod);
ctc.push_back(comp_curenta);
}
}
fout << ctc.size() << "\n";
for(const auto& comp : ctc)
{
for(auto nod : comp)
{
fout << nod << " ";
}
fout << "\n";
}
return 0;
}