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.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author N-AssassiN
 */
public class Main {

    static BufferedReader reader;
    static BufferedWriter writer;
    static StringTokenizer tokenizer;

    /**
     * call this method to initialize reader for InputStream and OututStream
     */
    static void init(InputStream input, OutputStream output) {
        reader = new BufferedReader(new InputStreamReader(input));
        writer = new BufferedWriter(new OutputStreamWriter(output));
        tokenizer = new StringTokenizer("");
    }

    /**
     * get next word
     */
    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            //TODO add check for eof if necessary
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

    public static void main(String[] args) throws IOException {
        init(System.in, System.out);
        int n = nextInt();
        int m = nextInt();
        int k = nextInt();
        int[] alice = new int[n];
        int[] bob = new int[m];
        int i;
        for (i = 0; i < n; i++) {
            alice[i] = nextInt();
        }
        for (i = 0; i < m; i++) {
            bob[i] = nextInt();
        }
        if (n > m) {
            writer.write("YES\n");
        } else {
            Arrays.sort(alice);
            Arrays.sort(bob);
            if (n == m) {
                boolean yes = true;
                for (i = 0; i < n; i++) {
                    if (alice[i] > bob[i]) {
                        writer.write("YES\n");
                        yes = false;
                        break;
                    }
                }
                if (yes) {
                    writer.write("NO\n");
                }
            } else {
                boolean yes = true;
                for (i = 0; i < n; i++) {
                    if (alice[i] > bob[i + m - n]) {
                        writer.write("YES\n");
                        yes = false;
                        break;
                    }
                }
                if (yes) {
                    writer.write("NO\n");
                }
            }
        }
        writer.flush();
    }
}