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.
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))

if n <= m:
    da = {}
    for i in a:
        if i not in da: da[i] = 0
        da[i] += 1
    db = {}
    for i in b:
        if i not in db: db[i] = 0
        db[i] += 1
    s = list(set(a + b))
    s.sort()
    k = len(s)
    p = {i: x for i, x in enumerate(s)}
    ac = bc = 0
    ok = False
    for i in range(1, k + 1):
        if p[k-i] in da:
            ac += da[p[k-i]]
        if p[k-i] in db:
            bc += db[p[k-i]]
        if ac > bc:
            ok = True
            break
    print("YES" if ok else "NO")
else:
    print('YES')
