It is known that there are *k* fish species in the polar ocean, numbered from 1 to *k*. They are sorted by non-decreasing order of their weight, which is a positive number. Let the weight of the *i*-th type of fish be *w*<sub class="lower-index">*i*</sub>, then 0 &lt; *w*<sub class="lower-index">1</sub> ≤ *w*<sub class="lower-index">2</sub> ≤ ... ≤ *w*<sub class="lower-index">*k*</sub> holds.

Polar bears Alice and Bob each have caught some fish, and they are guessing who has the larger sum of weight of the fish he/she's caught. Given the type of the fish they've caught, determine whether it is possible that the fish caught by Alice has a strictly larger total weight than Bob's. In other words, does there exist a sequence of weights *w*<sub class="lower-index">*i*</sub> (not necessary integers), such that the fish caught by Alice has a strictly larger total weight?
The first line contains three integers *n*, *m*, *k* (1 ≤ *n*, *m* ≤ 10<sup class="upper-index">5</sup>, 1 ≤ *k* ≤ 10<sup class="upper-index">9</sup>) — the number of fish caught by Alice and Bob respectively, and the number of fish species.

The second line contains *n* integers each from 1 to *k*, the list of fish type caught by Alice. The third line contains *m* integers each from 1 to *k*, the list of fish type caught by Bob.

Note that one may have caught more than one fish for a same species.
mod = 10**9 + 7 

def ways(n,k):
  if k==0:
    return 0
  dp = [0 for _ in range(n+1)]
  dp[0] = 1
  for i in range(1,n+1):
    for j in range(1,k+1):
      if i-j<0:
        break
      dp[i]+=dp[i-j]
  return dp[n]%mod
def solve():
	n,m,k = input().split(" ")
	a = [int(x) for x in input().split(" ")]
  b = [int(x) for x in input().split(" ")]
  a.sort()
  b.sort()
  ans = "NO"
  i = len(a)-1
  j = len(b)-1
  while (i>=0 and j>=0):
    if a[i]>b[j]:
      ans = "YES"
      print(ans)
      return
    i-=1
    j-=1
  return ans
def main():
	solve()
main()
