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 C (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct my_node {
	int val;
	struct my_node *next;
} Node;

Node *list, *last;

void add_node(int num)
{
	Node *t = (Node *)malloc(sizeof(Node));
	t->val=num;
	t->next=NULL;
	if(last==NULL)
		list=last=t;		
	else
	{
		last->next=t;
		last=t;
	}
}

int find(int num)
{
	Node *t=list;
	Node *t2;
	while(t!=NULL)
	{
		if(num==t->val)
		{
			if(t==list)
			{
				list=t->next;
			}
			else if(t->next != NULL)
			{
				t2->next = t->next;
			}
			else
			{
				t2->next = NULL;
			}
			return 1;
		}
		t2=t;
		t=t->next;
	}
	return 0;
}

void print_list()
{
	Node *t=list;
	while(t!=NULL)
	{
		printf("%d ", t->val);
		t=t->next;
	}
	printf("\n");
}

int main()
{
	int N,T,M;
	scanf("%d", &N);
	int i;
	for(i=0;i<N;i++)
	{
		scanf("%d", &T);
		add_node(T);
	}
	scanf("%d", &M);
	int f=0;
	for(i=0;i<M;i++)
	{
		scanf("%d", &T);
		f+=find(T);
	}
	if(f==M)
		puts("YES");
	else
		puts("NO");
	return 0;
}