module Main; import CPLib.Graph; import CPLib.IO; // import BinaryHeap; // import BoolArray; // import CPLib.Arithmetic; // import CPLib.Bipartite; import CPLib.Bits; // import CPLib.Convolution; // import CPLib.DSegtree; // import CPLib.LDSegtree; // import CPLib.LSegtree; // import CPLib.MaxFlow; // import CPLib.Memoize; // import CPLib.MinCostFlow; // import CPLib.Misc; // import CPLib.Monoid; // import CPLib.Segtree; // import CPLib.String; import CPLib.Trait; // import CPLib.TwoSat; // import CPLib.UnionFind; // import CPLib.ZP; // import HashMap; // import HashSet; main : IO () = ( let n = *read_i; let m = *read_i; let k = *read_i; // todo: コーナーケース k = 1 let graph = fill(n, fill(n, false)); let graph = if k >= 2 { let graph = range(0, k).fold(graph, |i, graph| graph[i][i+1].iset(true) ); let graph = range(k+1, n).fold(graph, |i, graph| let graph = graph[0][i].iset(true); let graph = graph[1][i].iset(true); let graph = graph[2][i].iset(true); graph ); graph } else { range(0, n).fold(graph, |i, graph| range(i+1, n).fold(graph, |j, graph| graph[i][j].iset(true) ) ) }; let edges_size = range(0, n).product(range(0, n)) .filter(|(i, j)| i < j && graph[i][j].iget).get_size; let min_cut = n*(n-1)/2 - edges_size; let max_cut = n*(n-1)/2 - k; if !(min_cut <= m && m <= max_cut) { "No".println }; let cut = m - min_cut; let (graph, cut) = range(0, n).fold((graph, cut), |i, (graph, cut)| range(i+1, n).fold((graph, cut), |j, (graph, cut)| if cut == 0 { (graph, cut) }; if j == i + 1 && j <= k { (graph, cut) }; if !graph[i][j].iget { (graph, cut) }; let graph = graph[i][j].iset(false); let cut = cut - 1; (graph, cut) ) ); assert_eq(|_|"cut did not end!", cut, 0);; let correct : I64 -> I64 = |i| ( let i = if i == k { n-1 } else if i == n-1 { k } else { i }; i + 1 ); "Yes".println;; range(0, n).fold_m((), |i, _| range(i+1, n).fold_m((), |j, _| if !graph[i][j].iget { let i = correct(i); let j = correct(j); "{} {}".printfln((i, j)) } else { pure() } ) );; pure() );