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.
//package com.congli.codeforces;

import java.io.*;
import java.util.*;

public class C180Div2D_FishWeight {

	BufferedReader in;
	PrintWriter out;
	StringTokenizer tok = new StringTokenizer("");

	public static void main(String[] args) {
		C180Div2D_FishWeight test = new C180Div2D_FishWeight();
		test.start();
	}

	public void solve() throws IOException 
	{
		int n = readInt();
		int m = readInt();
		int k = readInt();
		
		Hash[] hash = new Hash[m+n+10];
		HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
		
		int hash_ind = 0;
		int weight = 0;
		for(int i = 0; i < n; ++i)
		{
			weight = readInt();
			if(map.containsKey(weight))
				hash[map.get(weight)].count++;
			else
			{
				map.put(weight, hash_ind);
				hash[hash_ind++] = new Hash(weight, 1);
			}
		}
		
		for(int i = 0; i < m; ++i)
		{
			weight = readInt();
			if(map.containsKey(weight))
				hash[map.get(weight)].count--;
			else
			{
				map.put(weight, hash_ind);
				hash[hash_ind++] = new Hash(weight, -1);
			}
		}
		
		while(hash_ind < hash.length)
			hash[hash_ind++] = new Hash(0, 0);
		
		Arrays.sort(hash);
		calculate(hash);
	}
	
	public void calculate(Hash[] hash)
	{
		int i = 0;
		if(hash[0].count > 0)
		{
			out.println("YES");
			return;
		}
		
		int count_plus = 0, count_minus = 0;
		while(i < hash.length && hash[i].key > 0)
		{
			while(i < hash.length && hash[i].count <= 0)
				count_minus -= hash[i++].count;
			
			//count_minus = -count_minus;
			
			while(i < hash.length && hash[i].count >= 0)
				count_plus += hash[i++].count;
			
			if(count_plus > count_minus)
			{
				out.println("YES");
				return;
			}
			
			/*else if(count_plus < count_minus)
			{
				out.println("NO");
				return;
			}*/
		}
		
		out.println("NO");
	}
	
	class Hash implements Comparable<Hash>
	{
		int key;
		int count;
		public Hash(int key, int count)
		{
			this.key = key;
			this.count = count;
		}
		@Override
		public int compareTo(Hash o) {
			// TODO Auto-generated method stub
			return o.key - this.key;
		}

		
	}
	
	public void start()
	{
		try {
			long t1 = System.currentTimeMillis();
			if (System.getProperty("ONLINE_JUDGE") != null) {
				in = new BufferedReader(new InputStreamReader(System.in));
				out = new PrintWriter(System.out);
			} else {
				in = new BufferedReader(new FileReader("..\\Codeforces\\src\\com\\congli\\codeforces\\input.txt"));
				out = new PrintWriter(System.out);
			}
			Locale.setDefault(Locale.US);
			solve();
			in.close();
			out.close();
			long t2 = System.currentTimeMillis();
			System.err.println("Time = " + (t2 - t1));
		} catch (Throwable t) {
			t.printStackTrace(System.err);
			System.exit(-1);
		}
	}
	
	public String readString() throws IOException {
		while (!tok.hasMoreTokens()) {
			tok = new StringTokenizer(in.readLine());
		}
		return tok.nextToken();
	}

	public int readInt() throws IOException {
		return Integer.parseInt(readString());
	}

	public long readLong() throws IOException {
		return Long.parseLong(readString());
	}

	public double readDouble() throws IOException {
		return Double.parseDouble(readString());
	}
}
