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.
def find(a, n, sz):
    lo = 0
    hi = sz-1
    while lo <= hi:
        mid = int ((lo + hi) / 2) 
        if a[mid] == n :
            return mid
        if a[mid] < n :
            lo = mid + 1
        if a[mid] > n :
            hi = mid - 1
        # print(n, end=" ")
        # print(a[mid])
    return -1

n, m, k = map(int, input().split()) 
x = list(map(int, input().split()))
y = list(map(int, input().split()))
countA = [0] * (2*n + 5)
countB = [0] * (2*n + 5)
A = []
for i in range(n):
    A.append(x[i])
    A.append(y[i])
A.sort()
for i in range(n):
    id = find(A, x[i], 2*n)
    countA[id] += 1
    id = find(A, y[i], 2*n)
    countB[id] += 1
flag = 0
for i in range(2*n+1):
    id = find(A, i, 2*n)
    if id == -1:
        continue 
    if countA[i] > countB[i]:
        flag = 1 
if flag:
    print("YES")
else:
    print("NO")
