#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
const int max_n = 100005;
vector<int> adj[max_n];
int nivel[max_n], low[max_n];
bool in_stiva[max_n];
stack<int> st;
int timer = 0;
vector<vector<int>> rez;
void dfs(int u) {
// init timpi
nivel[u] = low[u] = ++timer;
// punem in stiva
st.push(u);
in_stiva[u] = true;
// parcurgem vecini
for (int v : adj[u]) {
if (!nivel[v]) {
// nod nevizitat
dfs(v);
low[u] = min(low[u], low[v]);
} else if (in_stiva[v]) {
// muchie de intoarcere
low[u] = min(low[u], nivel[v]);
}
}
// gasit radacina ctc
if (low[u] == nivel[u]) {
vector<int> comp;
int nod;
// scoatem din stiva
do {
nod = st.top();
st.pop();
in_stiva[nod] = false;
comp.push_back(nod);
} while (nod != u);
// salvam componenta
rez.push_back(comp);
}
}
int main() {
int n, m;
fin >> n >> m;
// citire graf orientat
for (int i = 0; i < m; ++i) {
int u, v;
fin >> u >> v;
adj[u].push_back(v);
}
// apel dfs pt noduri nevizitate
for (int i = 1; i <= n; ++i) {
if (!nivel[i]) {
dfs(i);
}
}
// afisare nr ctc
fout << rez.size() << "\n";
// afisare noduri per ctc
for (auto& comp : rez) {
for (int nod : comp) {
fout << nod << " ";
}
fout << "\n";
}
fin.close();
fout.close();
return 0;
}