#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
const int MAXN = 100005;
vector<int> adj[MAXN];
int discovery_time[MAXN], low[MAXN];
bool on_stack[MAXN];
stack<int> st;
int timer = 0;
vector<vector<int>> scc;
void dfs(int u) {
discovery_time[u] = low[u] = ++timer;
st.push(u);
on_stack[u] = true;
for (int v : adj[u]) {
if (!discovery_time[v]) {
dfs(v);
low[u] = min(low[u], low[v]);
} else if (on_stack[v]) {
low[u] = min(low[u], discovery_time[v]);
}
}
if (low[u] == discovery_time[u]) {
vector<int> component;
while (true) {
int node = st.top();
st.pop();
on_stack[node] = false;
component.push_back(node);
if (node == u) break;
}
scc.push_back(component);
}
}
int main() {
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n, m;
if (!(fin >> n >> m)) return 0;
for (int i = 0; i < m; ++i) {
int u, v;
fin >> u >> v;
adj[u].push_back(v);
}
for (int i = 1; i <= n; ++i) {
if (!discovery_time[i]) {
dfs(i);
}
}
fout << scc.size() << "\n";
for (const auto& comp : scc) {
for (size_t i = 0; i < comp.size(); ++i) {
fout << comp[i] << (i + 1 == comp.size() ? "" : " ");
}
fout << "\n";
}
return 0;
}