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 math
import  sys
from collections import defaultdict ,Counter,deque
from  bisect import  bisect_left
def values(f):return  tuple(map(int,f.readline().split()))
def value():return  tuple(map(int,sys.stdin.readline().split()))
def inlst(f):return  list(map(int,f.readline().split()))
def inlsts(f):return  deque(map(int ,f.readline().split()))
def inlss():return  deque(map(int ,sys.stdin.readline().split()))
def inlstb(f):return  deque((pow(2,int(i)) for i in f.readline().split()))
def inp(f):return  int(f.readline())

def solve():
    # f=open('/home/mohamed/Documents/w.txt')
    n,m,k=value()
    l1=sorted(inlss())
    l2=sorted(inlss())
    tot=n-m
    i=0;j=0
    for i in range(min(n,m)):
        if l1[i]> l2[i]:tot+=1
        elif l1[i]> l2[i]:tot-=1
    if tot>=0:return  "YES"
    # elif tot==0:

    return  "NO"


sys.stdout.write(str(solve())+'\n')


'''
7 4
4727447


7 7
4211147

4 1000000000
7747
'''