#include using namespace std; using ll = long long; namespace internal_scc{ template struct csr { std::vector start; std::vector elist; csr(int n, const std::vector>& edges) : start(n + 1), elist(edges.size()) { for (auto e : edges) { start[e.first + 1]++; } for (int i = 1; i <= n; i++) { start[i] += start[i - 1]; } auto counter = start; for (auto e : edges) { elist[counter[e.first]++] = e.second; } } }; struct scc_graph { public: scc_graph(int n) : _n(n) {} int num_vertices() { return _n; } void add_edge(int from, int to) { edges.push_back({from, {to}}); } std::pair> scc_ids() { auto g = csr(_n, edges); int now_ord = 0, group_num = 0; std::vector visited, low(_n), ord(_n, -1), ids(_n); visited.reserve(_n); auto dfs = [&](auto self, int v) -> void { low[v] = ord[v] = now_ord++; visited.push_back(v); for (int i = g.start[v]; i < g.start[v + 1]; i++) { auto to = g.elist[i].to; if (ord[to] == -1) { self(self, to); low[v] = std::min(low[v], low[to]); } else { low[v] = std::min(low[v], ord[to]); } } if (low[v] == ord[v]) { while (true) { int u = visited.back(); visited.pop_back(); ord[u] = _n; ids[u] = group_num; if (u == v) break; } group_num++; } }; for (int i = 0; i < _n; i++) { if (ord[i] == -1) dfs(dfs, i); } for (auto& x : ids) { x = group_num - 1 - x; } return {group_num, ids}; } std::vector> scc() { auto ids = scc_ids(); int group_num = ids.first; std::vector counts(group_num); for (auto x : ids.second) counts[x]++; std::vector> groups(ids.first); for (int i = 0; i < group_num; i++) { groups[i].reserve(counts[i]); } for (int i = 0; i < _n; i++) { groups[ids.second[i]].push_back(i); } return groups; } private: int _n; struct edge { int to; }; std::vector> edges; }; } struct scc_graph { public: scc_graph() : internal(0) {} scc_graph(int n) : internal(n) {} void add_edge(int from, int to) { int n = internal.num_vertices(); assert(0 <= from && from < n); assert(0 <= to && to < n); internal.add_edge(from, to); } std::vector> scc() { return internal.scc(); } private: internal_scc::scc_graph internal; }; int main(){ ios::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; vector>> g(n); scc_graph g2(n); for(int i = 0; i < m; i++){ int u, v; cin >> u >> v; u--, v--; g[u].emplace_back(v, 0); g2.add_edge(u, v); } vector idx(n); vector used(n), visited(n); auto dfs = [&](auto dfs, int v) -> int { if(used[v]) return -1; if(visited[v]) return v; visited[v] = true; for(int &j = idx[v]; j < g[v].size(); j++){ int u, c; tie(u, c) = g[v][j]; if(c == 1) continue; int res = dfs(dfs, u); if(res != -1){ g[v][j] = make_pair(u, 1); if(res != v){ visited[v] = false; return res; } } } visited[v] = false; used[v] = true; return -1; }; auto G = g2.scc(); for(auto &&vec : G){ for(auto &&v : vec){ dfs(dfs, v); } } vector> edge; for(int v = 0; v < n; v++){ for(auto &&pa : g[v]){ if(pa.second) continue; edge.emplace_back(v, pa.first); } } cout << n << " " << edge.size() << '\n'; for(auto &&pa : edge){ cout << pa.first + 1 << ' ' << pa.second + 1 << '\n'; } }