#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
vector<vector<int>> adj, adjT;
vector<bool> viz;
vector<int> order;
vector<vector<int>> ctc;
void dfs1(int nod) {
viz[nod] = true;
for (int vecin : adj[nod]) {
if (!viz[vecin]) dfs1(vecin);
}
order.push_back(nod);
}
void dfs2(int nod, vector<int>& comp) {
viz[nod] = true;
comp.push_back(nod);
for (int vecin : adjT[nod]) {
if (!viz[vecin]) dfs2(vecin, comp);
}
}
int main() {
int N, M;
fin >> N >> M;
adj.resize(N + 5);
adjT.resize(N + 5);
viz.resize(N + 5, false);
for (int i = 0; i < M; ++i) {
int x, y;
fin >> x >> y;
adj[x].push_back(y);
adjT[y].push_back(x);
}
for (int i = 1; i <= N; ++i) { // primul dfs
if (!viz[i]) dfs1(i);
}
fill(viz.begin(), viz.end(), false);
//al doilea dfs pe transpus
for (int i = N - 1; i >= 0; --i) {
int nod = order[i];
if (!viz[nod]) {
vector<int> comp;
dfs2(nod, comp);
ctc.push_back(comp);//am gasit ctc
}
}
fout << ctc.size() << "\n"; // afisare
for (auto& comp : ctc) {
for (int nod : comp) {
fout << nod << " ";
}
fout << "\n";
}
return 0;
}