Fish Weight

题意翻译

### 题意简述 极地海洋中有 $k$ 种鱼类,编号为 $1$ 到 $k$。它们的重量 $w_i$ 非负且满足 $\forall i\in\left[2,k\right]\cap\N,w_i\ge w_{i-1}$(单调非降)。 北极熊 Alice 和 Bob 各自抓了一些鱼,要判断是否存在 $w_i$ 使得 Alice 的鱼的总重量比 Bob 的大。 ### 样例 1 解释 令 $w_1=1,w_2=2,w_3=2.5$,即可使得 $w_{A}=6,w_{B}=4.5$,所以此情况输出 `YES`,否则输出 `NO`.

题目描述

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_{i} $ , then $ 0&lt;w_{1}<=w_{2}<=...<=w_{k} $ 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_{i} $ (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^{5},1<=k<=10^{9}) $ — 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.

输出格式


Output "YES" (without quotes) if it is possible, and "NO" (without quotes) otherwise.

输入输出样例

输入样例 #1

3 3 3
2 2 2
1 1 3

输出样例 #1

YES

输入样例 #2

4 7 9
5 2 7 3
3 5 2 7 3 8 7

输出样例 #2

NO

说明

In the first sample, if $ w_{1}=1,w_{2}=2,w_{3}=2.5 $ , then Alice has a total of $ 2+2+2=6 $ weight units, while Bob only has $ 1+1+2.5=4.5 $ . In the second sample, the fish that Alice caught is a subset of Bob's. Therefore, the total weight of Bob’s fish is always not less than the total weight of Alice’s fish.