A10043 | Arrays

You are given two arrays $A$ and $B$ consisting of integers, sorted in non-decreasing order. Check whether it is possible to choose $k$ numbers in array $A$ and choose $m$ numbers in array $B$ so that any number chosen in the first array is strictly less than any number chosen in the second array.

The first line contains two integers $n_{A},n_{B}$ ( $1<=n_{A},n_{B}<=10^{5}$ ), separated by a space — the sizes of arrays $A$ and $B$ , correspondingly.

The second line contains two integers $k$ and $m$ ( $1<=k<=n_{A},1<=m<=n_{B}$ ), separated by a space.

The third line contains $n_{A}$ numbers $a_{1},a_{2},...\ a_{nA}$ ( $-10^{9}<=a_{1}<=a_{2}<=...<=a_{nA}<=10^{9}$ ), separated by spaces — elements of array $A$ .

The fourth line contains $n_{B}$ integers $b_{1},b_{2},...\ b_{nB}$ ( $-10^{9}<=b_{1}<=b_{2}<=...<=b_{nB}<=10^{9}$ ), separated by spaces — elements of array $B$ .

Print "YES" (without the quotes), if you can choose $k$ numbers in array $A$ and $m$ numbers in array $B$ so that any number chosen in array $A$ was strictly less than any number chosen in array $B$ . Otherwise, print "NO" (without the quotes).