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.Arrays;
import java.util.StringTokenizer;
import java.util.TreeMap;

public class B {
	public static void main(String[] args) throws IOException {
		InputReader in = new InputReader();
		int n = in.nextInt();
		int m = in.nextInt();
		int k = in.nextInt();
		int[] ar = new int[n + m ];
		TreeMap<Integer, Integer> tr = new TreeMap<Integer, Integer>();
		int[] a = new int[n];
		int[] b = new int[m];
		int[] all = new int[n+m];
		for (int i = 0; i < n; i++)
			a[i] = in.nextInt();
		for (int j = 0; j < m; j++)
			b[j] = in.nextInt();
		int top = 0;
		for(int i = 0 ;i<n;i++)
			all[i]=a[i];
		for(int j = 0 ; j < m;j++)
			all[j+n]=b[j];
		Arrays.sort(all);
		for (int i = 0; i < n+m; i++) {
			int t = all[i];
			if(!tr.containsKey(t))
				tr.put(t, top++);
		}

		for (int i = 0; i < n; i++) {
			int t = a[i];
			Integer x = tr.get(t);
			ar[x]++;
		}
		for (int i = 0; i < m; i++) {
			int t = b[i];
			Integer x = tr.get(t);
			ar[x]--;
		}
		int[] suf = new int[n + m ];
		suf[n + m  - 1] = ar[n + m  - 1];
		for (int i = n + m  - 2; i >= 0; i--)
			suf[i] = suf[i + 1] + ar[i];
		boolean ok = false;
		for (int i = 0; i < ar.length && !ok; i++) {
//			System.out.println(suf[i]);
			if (suf[i] > 0)
				ok = true;
		}
		if (ok)
			System.out.println("YES");
		else
			System.out.println("NO");
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer st;

		public InputReader() throws IOException {
			in = new BufferedReader(new InputStreamReader(System.in));
			st = new StringTokenizer(in.readLine());
		}

		public String next() throws IOException {
			while (!st.hasMoreElements())
				st = new StringTokenizer(in.readLine());
			return st.nextToken();
		}

		public int nextInt() throws NumberFormatException, IOException {
			return Integer.parseInt(next());
		}

		public long nextLong() throws NumberFormatException, IOException {
			return Long.parseLong(next());
		}
	}
}