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 Practice3.CF298;

import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;

public class CF298D {
    public static void main(String[] args) throws IOException {
//        Scanner s = new Scanner(System.in);
        Reader s = new Reader();
        int n = s.nextInt();
        int m = s.nextInt();
        int k = s.nextInt();
        int[] arr = new int[n];

        HashMap<Integer, Integer> map1 = new HashMap<>();
        for (int i = 0; i < n; i++) {
            arr[i] = s.nextInt();
            map1.put(arr[i], map1.getOrDefault(arr[i], 0) + 1);
        }

        int[] brr = new int[m];
        HashMap<Integer, Integer> map2 = new HashMap<>();
        for (int i = 0; i < m; i++) {
            brr[i] = s.nextInt();
            map2.put(brr[i], map2.getOrDefault(brr[i], 0) + 1);
        }

//        Arrays.sort(arr);
//        Arrays.sort(brr);

//        ArrayList<Integer> list1 = new ArrayList<>();
//        for (int i = 0; i < arr.length; i++) {
//            list1.add(arr[i]);
//        }
//
//        ArrayList<Integer> list2 = new ArrayList<>();
//        for (int i = 0; i < brr.length; i++) {
//            list2.add(brr[i]);
//        }

//        Collections.sort(list1);
//        Collections.sort(list2);

//        ArrayList<Integer> intersection = (ArrayList<Integer>) list1.clone();
//        intersection.remove(list2);
//        list2.remove(list1);
//        list1 = intersection;

        HashMap<Integer, Integer> map3 = new HashMap<>();
        ArrayList<Integer> list = new ArrayList<>(map1.keySet());
        for (int i = 0; i < list.size(); i++) {
            if(map2.containsKey(list.get(i))){
                int k1 = map1.get(list.get(i));
                int k2 = map2.get(list.get(i));

                if(k1 > k2){
                    map2.remove(list.get(i));
                    map1.put(list.get(i), k1 - k2);
                }else{
                    map1.remove(list.get(i));
                    map2.put(list.get(i), k2 - k1);
                }
            }
        }

        list = new ArrayList<>(map1.keySet());
        ArrayList<Integer> list1 = new ArrayList<>();
        for (int i = 0; i < list.size(); i++) {
            int num = list.get(i);
            int freq = map1.get(num);
            for (int j = 0; j < freq; j++) {
                list1.add(num);
            }
        }

        list = new ArrayList<>(map2.keySet());
        ArrayList<Integer> list2 = new ArrayList<>();
        for (int i = 0; i < list.size(); i++) {
            int num = list.get(i);
            int freq = map2.get(num);
            for (int j = 0; j < freq; j++) {
                list2.add(num);
            }
        }

        Collections.sort(list1);
        Collections.sort(list2);

        if(list1.size() > list2.size()){
            System.out.println("YES");
            return;
        }

        if(list1.size() == 0){
            System.out.println("NO");
            return;
        }
        if(list1.get(list1.size() - 1) > list2.get(list2.size() - 1)){
            System.out.println("YES");
            return;
        }



        int i = list1.size() - 1;
        int j = list2.size() - 1;
        boolean bool = false;
        while(i >= 0){
            if(list1.get(i) < list2.get(j)){
                i--;
                j--;
            }else{
                bool = true;
                break;
            }
        }

        if(bool){
            System.out.println("YES");
        }else{
            System.out.println("NO");
        }
    }
    
    private static class Reader
    {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public Reader()
        {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public Reader(String file_name) throws IOException
        {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException
        {
            byte[] buf = new byte[64]; // line length 
            int cnt = 0, c;
            while ((c = read()) != -1)
            {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException
        {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do
            {
                ret = ret * 10 + c - '0';
            }  while ((c = read()) >= '0' && c <= '9');

            if (neg)
                return -ret;
            return ret;
        }

        public long nextLong() throws IOException
        {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }

        public double nextDouble() throws IOException
        {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();

            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');

            if (c == '.')
            {
                while ((c = read()) >= '0' && c <= '9')
                {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg)
                return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException
        {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }

        private byte read() throws IOException
        {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException
        {
            if (din == null)
                return;
            din.close();
        }
    }
}
