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.
import sys

def intersect(a, b):
    new_a, new_b = [], []

    while len(a) != 0 and len(b) != 0:
        if a[0] == b[0]:
            a = a[1:]
            b = b[1:]
            continue
        if a[0] < b[0]:
            new_a.append(a[0])
            a = a[1:]
        else:
            new_b.append(b[0])
            b = b[1:]

    if len(a) != 0:
        new_a += a
    if len(b) != 0:
        new_b += b

    return new_a, new_b

def n_greater(num, b):
    result = 0
    for elem in b:
        if elem > num:
            result += 1
    return result

num_alice, num_bob, n_types = tuple(int(x) for x in sys.stdin.readline().split())
alice = sorted([int(x) for x in sys.stdin.readline().split()])
bob = sorted([int(x) for x in sys.stdin.readline().split()])

a, b = intersect(alice, bob)

if len(a) == 0:
    print("NO")
    sys.exit(0)

n_g = n_greater(a[-1], b)

if n_g >= len(a):
    print("NO")
else:
    print("YES")
