Problem:
Score : 200 points

Problem Statement

Rng is preparing a problem set for a qualification round of CODEFESTIVAL.

He has N candidates of problems. The difficulty of the i-th candidate is D_i.

There must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.

Determine whether Rng can complete the problem set without creating new candidates of problems.

Constraints

1 \leq N \leq 200,000

1 \leq D_i \leq 10^9

1 \leq M \leq 200,000

1 \leq T_i \leq 10^9

All numbers in the input are integers.

Partial Score

100 points will be awarded for passing the test set satisfying N \leq 100 and M \leq 100.

Input

Input is given from Standard Input in the following format:

N
D_1 D_2 ... D_N
M
T_1 T_2 ... T_M

Output

Print YES if Rng can complete the problem set without creating new candidates of problems; print NO if he cannot.

Sample Input 1

5
3 1 4 1 5
3
5 4 3

Sample Output 1

YES

Sample Input 2

7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600

Sample Output 2

NO

Not enough 1600s.

Sample Input 3

1
800
5
100 100 100 100 100

Sample Output 3

NO

Sample Input 4

15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5

Sample Output 4

YES

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.util.HashMap;
import java.util.Scanner;
import java.util.stream.Stream;

public class Main {
    public static void main(String[] args){
        int N = 0;
        int D[] = new int[0];
        int M = 0;
        int T[] = new int[0];

        Scanner in = new Scanner(System.in);
        for(int i=0; i < 4; i++) {
            String s = in.nextLine();
            String[] split = s.split(" ");
//            System.out.println(split);
            switch (i) {
                case 0:
                    N = Integer.parseInt(split[0]);
                    D = new int[N];
                    break;
                case 1:
                    D = Stream.of(split).mapToInt(Integer::parseInt).toArray();
                    break;
                case 2:
                    M = Integer.parseInt(split[0]);
                    break;
                case 3:
                    T = Stream.of(split).mapToInt(Integer::parseInt).toArray();
            }
        }

//        System.out.println(N);
//        for(int i=0; i < D.length; i++){
//            System.out.print(D[i]);
//        }
//        System.out.println();
//        System.out.println(M);
//        for(int i=0; i < T.length; i++){
//            System.out.print(T[i]);
//        }
//        System.out.println();

//////////////////
//        int N = 0;
//        int D[] = new int[0];
//        int M = 0;
//        int T[] = new int[0];
//////////////////
        HashMap<Integer,Integer> DD = new HashMap<Integer,Integer>();
        for (int i = 0; i < D.length; i++) {
            try {
                int a = DD.get(D[i]);
                DD.put(D[i], a + 1);
            } catch (Exception e) {
                DD.put(D[i], 1);
            }
        }
//        for (Integer key : DD.keySet()) {
//            System.out.println(key + ": " + DD.get(key));
//        }

        System.out.println();

        HashMap<Integer,Integer> TT = new HashMap<Integer,Integer>();
        for (int i = 0; i < T.length; i++) {
            try {
                int a = TT.get(T[i]);
                TT.put(T[i], a + 1);
            } catch (Exception e) {
                TT.put(T[i], 1);
            }
        }
//        for (Integer key : TT.keySet()) {
//            System.out.println(key + ": " + TT.get(key));
//        }

        for (Integer key : TT.keySet()) {
            int d, t;
            try {
                d = DD.get(key);
                t = TT.get(key);
            } catch (Exception e) {
                System.out.println("NO");
                return;
            }
            if(d < t) {
                System.out.println("NO");
                return;
            }
        }
        System.out.println("YES");
    }
}