Problem Statement

In Japan, there are six types of coins in circulation: $1$ yen, $5$ yen, $10$ yen, $50$ yen, $100$ yen, and $500$ yen. Answer the following question regarding these coins.

Mr. AtCoder's wallet contains $A$ $1$-yen coins, $B$ $5$-yen coins, $C$ $10$-yen coins, $D$ $50$-yen coins, $E$ $100$-yen coins, and $F$ $500$-yen coins.

He is planning to shop at $N$ stores in sequence. Specifically, at the $i$-th store $(1 \leq i \leq N)$, he plans to buy one item that costs $X_i$ yen (including tax).

Giving and receiving change takes time, so he wants to choose his coins so that he can pay the exact amount at each store. Determine if this is possible.

Constraints

• $0 \leq A \leq 200$
• $0 \leq B \leq 200$
• $0 \leq C \leq 200$
• $0 \leq D \leq 200$
• $0 \leq E \leq 200$
• $0 \leq F \leq 200$
• $1 \leq N \leq 10$
• $1 \leq X_i \leq 10000 \ (1 \leq i \leq N)$
• All input values are integers.

Input

The input is given from Standard Input in the following format:

A B C D E F
N
X_1 X_2 \cdots X_N

Output

Print Yes if the objective is achievable, and No otherwise.