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.*;
import java.util.*;

import static java.lang.Math.*;

public class B implements Runnable {

    Scanner in;
    PrintWriter out;
    
    public static void main(String[] args) {
        new Thread(null, new B(), "", 64*1024*1024).start();
        //new Template().run();
    }

    public void run() {
        try {
            long t1 = 0, t2 = 0;
            if (LOCAL) {
                t1 = System.currentTimeMillis();
            }
            Locale.setDefault(Locale.US);
            if (LOCAL) {
                in = new Scanner("input.txt");
                out = new PrintWriter("output.txt");
            } else {
                in = new Scanner(System.in);
                out = new PrintWriter(System.out);
            }
            solve();
            in.close();
            out.close();
            if (LOCAL) {
                t2 = System.currentTimeMillis();
                System.err.println("Time = " + (t2 - t1) + " ms.");
            }
        } catch (Throwable e) {
            e.printStackTrace(System.err);
            throw new RuntimeException();
        }
    }
     
    int readInt() throws IOException {
        return in.nextInt();
    }
    
    long readLong() throws IOException {
        return in.nextLong();
    }
    
    double readDouble() throws IOException {
        return in.nextDouble();
    }
    
    static class Mergesort {

        private Mergesort() {}

        public static void sort(int[] a) {
            mergesort(a, 0, a.length - 1);
        }

        public static void sort(long[] a) {
            mergesort(a, 0, a.length - 1);
        }

        public static void sort(double[] a) {
            mergesort(a, 0, a.length - 1);
        }

        private static final int MAGIC_VALUE = 42;

        private static void mergesort(int[] a, int leftIndex, int rightIndex) {
            if (leftIndex < rightIndex) {
                if (rightIndex - leftIndex <= MAGIC_VALUE) {
                    insertionSort(a, leftIndex, rightIndex);
                } else {
                    int middleIndex = (leftIndex + rightIndex) / 2;
                    mergesort(a, leftIndex, middleIndex);
                    mergesort(a, middleIndex + 1, rightIndex);
                    merge(a, leftIndex, middleIndex, rightIndex);
                }
            }
        }

        private static void mergesort(long[] a, int leftIndex, int rightIndex) {
            if (leftIndex < rightIndex) {
                if (rightIndex - leftIndex <= MAGIC_VALUE) {
                    insertionSort(a, leftIndex, rightIndex);
                } else {
                    int middleIndex = (leftIndex + rightIndex) / 2;
                    mergesort(a, leftIndex, middleIndex);
                    mergesort(a, middleIndex + 1, rightIndex);
                    merge(a, leftIndex, middleIndex, rightIndex);
                }
            }
        }

        private static void mergesort(double[] a, int leftIndex, int rightIndex) {
            if (leftIndex < rightIndex) {
                if (rightIndex - leftIndex <= MAGIC_VALUE) {
                    insertionSort(a, leftIndex, rightIndex);
                } else {
                    int middleIndex = (leftIndex + rightIndex) / 2;
                    mergesort(a, leftIndex, middleIndex);
                    mergesort(a, middleIndex + 1, rightIndex);
                    merge(a, leftIndex, middleIndex, rightIndex);
                }
            }
        }

        private static void merge(int[] a, int leftIndex, int middleIndex, int rightIndex) {
            int length1 = middleIndex - leftIndex + 1;
            int length2 = rightIndex - middleIndex;
            int[] leftArray = new int[length1];
            int[] rightArray = new int[length2];
            System.arraycopy(a, leftIndex, leftArray, 0, length1);
            System.arraycopy(a, middleIndex + 1, rightArray, 0, length2);
            for (int k = leftIndex, i = 0, j = 0; k <= rightIndex; k++) {
                if (i == length1) {
                    a[k] = rightArray[j++];
                } else if (j == length2) {
                    a[k] = leftArray[i++];
                } else {
                    a[k] = leftArray[i] <= rightArray[j] ? leftArray[i++] : rightArray[j++];
                }
            }
        }

        private static void merge(long[] a, int leftIndex, int middleIndex, int rightIndex) {
            int length1 = middleIndex - leftIndex + 1;
            int length2 = rightIndex - middleIndex;
            long[] leftArray = new long[length1];
            long[] rightArray = new long[length2];
            System.arraycopy(a, leftIndex, leftArray, 0, length1);
            System.arraycopy(a, middleIndex + 1, rightArray, 0, length2);
            for (int k = leftIndex, i = 0, j = 0; k <= rightIndex; k++) {
                if (i == length1) {
                    a[k] = rightArray[j++];
                } else if (j == length2) {
                    a[k] = leftArray[i++];
                } else {
                    a[k] = leftArray[i] <= rightArray[j] ? leftArray[i++] : rightArray[j++];
                }
            }
        }

        private static void merge(double[] a, int leftIndex, int middleIndex, int rightIndex) {
            int length1 = middleIndex - leftIndex + 1;
            int length2 = rightIndex - middleIndex;
            double[] leftArray = new double[length1];
            double[] rightArray = new double[length2];
            System.arraycopy(a, leftIndex, leftArray, 0, length1);
            System.arraycopy(a, middleIndex + 1, rightArray, 0, length2);
            for (int k = leftIndex, i = 0, j = 0; k <= rightIndex; k++) {
                if (i == length1) {
                    a[k] = rightArray[j++];
                } else if (j == length2) {
                    a[k] = leftArray[i++];
                } else {
                    a[k] = leftArray[i] <= rightArray[j] ? leftArray[i++] : rightArray[j++];
                }
            }
        }

        private static void insertionSort(int[] a, int leftIndex, int rightIndex) {
            for (int i = leftIndex + 1; i <= rightIndex; i++) {
                int current = a[i];
                int j = i - 1;
                while (j >= leftIndex && a[j] > current) {
                    a[j + 1] = a[j];
                    j--;
                }
                a[j + 1] = current;
            }
        }

        private static void insertionSort(long[] a, int leftIndex, int rightIndex) {
            for (int i = leftIndex + 1; i <= rightIndex; i++) {
                long current = a[i];
                int j = i - 1;
                while (j >= leftIndex && a[j] > current) {
                    a[j + 1] = a[j];
                    j--;
                }
                a[j + 1] = current;
            }
        }

        private static void insertionSort(double[] a, int leftIndex, int rightIndex) {
            for (int i = leftIndex + 1; i <= rightIndex; i++) {
                double current = a[i];
                int j = i - 1;
                while (j >= leftIndex && a[j] > current) {
                    a[j + 1] = a[j];
                    j--;
                }
                a[j + 1] = current;
            }
        }

    }
    
    void debug(Object... o) {
        if (LOCAL) {
            System.err.println(Arrays.deepToString(o));
        }
    }
    
    final static boolean LOCAL = System.getProperty("ONLINE_JUDGE") == null;//System.getProperty("os.name") != null && System.getProperty("os.name").contains("Windows");//
    
//------------------------------------------------------------------------------

    void solve() throws IOException {
        int n = readInt();
        int m = readInt();
        int k = readInt();
        int[] a = new int[n];
        int[] b = new int[m];
        for (int i = 0; i < n; i++) {
            a[i] = readInt();
        }
        for (int i = 0; i < m; i++) {
            b[i] = readInt();
        }
        if (n > m) {
            out.println("YES");
            return;
        }
        Mergesort.sort(a);
        Mergesort.sort(b);
        TreeMap<Integer, Integer> map = new TreeMap<Integer, Integer>();
        for (int i = 0, j = 0; i < n || j < m; ) {
            if (j == m) {
                add(map, a[i++]);
            } else if (i == n) {
                add(map, b[j++]);
            } else if (a[i] < b[j]) {
                add(map, a[i++]);
            } else {
                add(map, b[j++]);
            }
        }
        for (int i = 0; i < n; i++) {
            a[i] = map.get(a[i]);
        }
        for (int i = 0; i < m; i++) {
            b[i] = map.get(b[i]);
        }
        int[] acnts = new int[map.size()];
        int[] bcnts = new int[map.size()];
        for (int x : a) {
            acnts[x]++;
        }
        for (int x : b) {
            bcnts[x]++;
        }
        debug(acnts);
        debug(bcnts);
        for (int i = 1; i < acnts.length; i++) {
            acnts[i] += acnts[i-1];
        }
        for (int i = 1; i < bcnts.length; i++) {
            bcnts[i] += bcnts[i-1];
        }
        debug(acnts);
        debug(bcnts);
        for (int begin = 0; begin <= acnts.length - 1; begin++) {
            int asum = getSum(acnts, begin, acnts.length - 1);
            int bsum = getSum(bcnts, begin, bcnts.length - 1);
            debug(asum, bsum);
            if (asum > bsum) {
                out.println("YES");
                return;
            }
        }
        out.println("NO");
    }

    private void add(TreeMap<Integer, Integer> map, int x) {
        if (!map.containsKey(x)) {
            map.put(x, map.size());
        }
    }

    private int getSum(int[] a, int L, int R) {
        int s = a[R];
        if (L > 0) s -= a[L-1];
        return s;
    }
    
}