#include <fstream>
#include <vector>
#include <stack>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
const int MAXN = 100005;
vector<int> adj[MAXN], rev_adj[MAXN];
bool viz[MAXN];
stack<int> st;
vector<vector<int>> ctc;
void dfs1(int u) {
viz[u] = true;
for (int v : adj[u]) {
if (!viz[v]) dfs1(v);
}
st.push(u);
}
void dfs2(int u, vector<int>& comp) {
viz[u] = false;
comp.push_back(u);
for (int v : rev_adj[u]) {
if (viz[v]) dfs2(v, comp);
}
}
int main() {
int n, m;
fin >> n >> m;
for (int i = 0; i < m; ++i) {
int u, v;
fin >> u >> v;
adj[u].push_back(v);
rev_adj[v].push_back(u);
}
for (int i = 1; i <= n; ++i) {
if (!viz[i]) dfs1(i);
}
while (!st.empty()) {
int u = st.top();
st.pop();
if (viz[u]) {
vector<int> comp;
dfs2(u, comp);
ctc.push_back(comp);
}
}
fout << ctc.size() << "\n";
for (const auto& comp : ctc) {
for (int node : comp) {
fout << node << " ";
}
fout << "\n";
}
return 0;
}