$n$ rooks and $k$ pawns are arranged on a $100 \times 100$ board. The rooks cannot leap over pawns. For which minimum $k$ is it possible that no rook can capture any other rook? Junior League: $n=2551$ (Proposed by A. Kuznetsov) Senior League: $n=2550$ (Proposed by N. Vlasova)