$L$ $R$ $M$
$a_ 0$ $b_ 0$
$a_ 1$ $b_ 1$
:
$a_ {M - 1}$ $b_ {M - 1}$

$K$
$c_ 0$ $d_ 0$
$c_ 1$ $d_ 1$
:
$c_ {K - 1}$ $d_ {K - 1}$

$K$ is the number of maximum matching, and $(c_ i, d_ i)$ is the edge of the matching.

• $1 \leq L, R \leq 100,000$
• $1 \leq M \leq 200,000$
• $0 \leq a_ i < L$
• $0 \leq b_ i < R$
• There is no multiple edges.

Note that timelimit is different from https://judge.yosupo.jp/problem/bipartitematching

library checker: bipartitematching