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.
from collections import  Counter,defaultdict
import heapq

n,m,k=[int(x) for x  in input().split()]
a=[int(x) for x  in input().split()]
b=[int(x) for x  in input().split()]
cnt=defaultdict(int)
for c in a:
    cnt[c]+=1

for c in b:
    cnt[c]-=1


def solve():

    hq1=[]
    hq2=[]
    for k,v in cnt.items():
        if v>0:
            heapq.heappush(hq1,(k,v))
        if v<0:
            heapq.heappush(hq2,(k,v))

    while hq1 and hq2:
        k1,v1=heapq.heappop(hq1)

        while hq2[0][0]<k1:
            k2,v2=heapq.heappop(hq2)
        if hq2:

            k2, v2 = heapq.heappop(hq2)
        else:
            break

        if v1<-v2:
            heapq.heappush(hq2,(k2,v2+v1))

        elif v1>-v2:
            heapq.heappush(hq1,(k1,v1+v2))


    if hq1:
        return False
    else:
        return True

if solve():
    print('NO')
else:
    print('YES')


