题目描述
Farmer John有 B B B头奶牛 ( 1 ≤ B ≤ 25000 ) (1 \leq B \leq 25000) (1≤B≤25000),有 N ( 2 ∗ B ≤ N ≤ 50000 ) N(2*B \leq N \leq 50000) N(2∗B≤N≤50000)个农场,编号 1 ∼ N 1 \sim N 1∼N,有 M ( N − 1 ≤ M ≤ 100000 ) M(N-1 \leq M \leq 100000) M(N−1≤M≤100000)条双向边,第 i i i条边连接农场 R i R_i Ri和 S i S_i Si ( 1 ≤ R i ≤ N ; 1 ≤ S i ≤ N ) (1 \leq R_i \leq N;1 \leq S_i \leq N) (1≤Ri