Score : 200 points
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.
Input is given from Standard Input in the following format:
N D_1 D_2 ... D_N M T_1 T_2 ... T_M
Print YES
if Rng can complete the problem set without creating new candidates of problems; print NO
if he cannot.
5 3 1 4 1 5 3 5 4 3
YES
7 100 200 500 700 1200 1600 2000 6 100 200 500 700 1600 1600
NO
Not enough 1600s.
1 800 5 100 100 100 100 100
NO
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
YES