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 wi, then 0 < w1 ≤ w2 ≤ ... ≤ wk 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 wi (not necessary integers), such that the fish caught by Alice has a strictly larger total weight?

Input

The first line contains three integers n, m, k (1 ≤ n, m ≤ 105, 1 ≤ k ≤ 109) — 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

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

Examples

Input

3 3 3
2 2 2
1 1 3


Output

YES


Input

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


Output

NO

Note

In the first sample, if w1 = 1, w2 = 2, w3 = 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.
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;


public class B {
	
	static class Scanner{
		BufferedReader br=null;
		StringTokenizer tk=null;
		public Scanner(){
			br=new BufferedReader(new InputStreamReader(System.in));
		}
		public String next() throws IOException{
			while(tk==null || !tk.hasMoreTokens())
				tk=new StringTokenizer(br.readLine());
			return tk.nextToken();
		}
		public int nextInt() throws NumberFormatException, IOException{
			return Integer.valueOf(next());
		}
		public double nextDouble() throws NumberFormatException, IOException{
			return Double.valueOf(next());
		}
		public long nextLong() throws NumberFormatException, IOException{
			return Long.valueOf(next());
		}
	}
	
	int N,M,K;
	
	public static void main(String args[]) throws NumberFormatException, IOException{
		Scanner sc = new Scanner();
		int N = sc.nextInt();
		int M = sc.nextInt();
		int K = sc.nextInt();
		int[] AT = new int[N];
		int[] BT = new int[M];
		TreeSet<Integer> w = new TreeSet<Integer>();
		for(int  i = 0 ; i < N; i++){
			AT[i] = sc.nextInt();
			w.add(AT[i]);
		}
		for(int  i = 0 ; i < M; i++){
			BT[i] = sc.nextInt();
			w.add(BT[i]);
		}
		TreeMap<Integer,Integer> map = new TreeMap<Integer,Integer>();
		int index = 0;
		for(int e: w){
			map.put(e, index);
			index++;
		}
		int[] A = new int[index];
		int[] B = new int[index];
		for(int i = 0; i < N; i++){
			int we = map.get(AT[i]);
			A[we]++;
		}
		for(int i = 0; i < M; i++){
			int we = map.get(BT[i]);
			B[we]++;
		}
		int k = index - 1;
		int coa = 0;
		int cob = 0;
		boolean flag = false;
		while(k >= 0){
			while(k >= 0 && A[k] == 0){
				cob += B[k];
				k--;
			}
			if (k < 0)
				break;
			coa += A[k];
			cob += B[k];
			k--;
			if (coa > cob){
				flag = true;
				break;
			}
			cob = cob - coa;
			coa = 0;
		}
		if (flag)
			System.out.println("YES");
		else
			System.out.println("NO");
	}

}