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: Runtime Error)

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


class Main {
    public static void main(String args[]) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        String strStdIn = in.readLine();
        
        int cnt = 0;
        
        int n;
        
        Map<String, String> d = new HashMap<String, String>();
        
        String[] ar;
        int m;
        Map<String, String> t = new HashMap<String, String>();
        
        while(strStdIn!=null){ //EOFまで処理継続
            //処理を記載

        		cnt++;
        		
        		if(cnt == 0) {
        			n = Integer.parseInt(in.readLine());
        		}else if (cnt == 1) {
        			ar = in.readLine().split(" ");
        			
        			for(int i =0; i < ar.length; i++) {
        				d.put(ar[i],ar[i]);
        			}
        		}else if (cnt == 2) {
				m = Integer.parseInt(in.readLine());
        		}else if (cnt == 3) {
        			ar = in.readLine().split(" ");
                			
                			for(int i =0; i < ar.length; i++) {
                				t.put(ar[i],ar[i]);
                			}
        		}
        		
            strStdIn = in.readLine();
        }
        
        for (String key1 : t.keySet()) {
            for(String key2 : d.keySet()) {
            		if(t.get(key1) == d.get(key2)) {
            			t.remove(key1);
            			d.remove(key2);
            		}
            }
        }
        
        if(d == null) {
        	System.out.println("YES");
        }else {
        	System.out.println("NO");
        }
        
        
    }
}