E - Good Pair

Chef has two arrays $A_1 ,A_2 ,A_3 . . . A_N$ and $B_1,B_2 ,B_3 . . . B_M$. He can perform the following moves $\text{any number of times}$: - Select an index $i$ such that $1 \leq i \leq N$ and delete the element $A[i]$. - Select an index $j$ such that $1 \leq j \leq M$ and delete the element $B[j]$. Two arrays of length $K$ are called a $good$ $pair$ if, after each of them is sorted i