The organizers of a programming contest have decided to present t-shirts to participants. There are six different t-shirts sizes in this problem: _S_, _M_, _L_, _XL_, _XXL_, _XXXL_ (sizes are listed in increasing order). The t-shirts are already prepared. For each size from _S_ to _XXXL_ you are given the number of t-shirts of this size.
During the registration, the organizers asked each of the _n_ participants about the t-shirt size he wants. If a participant hesitated between two sizes, he could specify two neighboring sizes — this means that any of these two sizes suits him.
Write a program that will determine whether it is possible to present a t-shirt to each participant of the competition, or not. Of course, each participant should get a t-shirt of proper size:
* the size he wanted, if he specified one size;
* any of the two neibouring sizes, if he specified two sizes.
If it is possible, the program should find any valid distribution of the t-shirts.
## Input
The first line of the input contains six non-negative integers — the number of t-shirts of each size. The numbers are given for the sizes _S_, _M_, _L_, _XL_, _XXL_, _XXXL_, respectively. The total number of t-shirts doesn't exceed 100 000.
The second line contains positive integer _n_ (1 ≤ _n_ ≤ 100 000) — the number of participants.
The following _n_ lines contain the sizes specified by the participants, one line per participant. The _i_\-th line contains information provided by the _i_\-th participant: single size or two sizes separated by comma (without any spaces). If there are two sizes, the sizes are written in increasing order. It is guaranteed that two sizes separated by comma are neighboring.
## Output
If it is not possible to present a t-shirt to each participant, print «_NO_» (without quotes).
Otherwise, print _n_ + 1 lines. In the first line print «_YES_» (without quotes). In the following _n_ lines print the t-shirt sizes the orginizers should give to participants, one per line. The order of the participants should be the same as in the input.
If there are multiple solutions, print any of them.
[samples]
**Definitions:**
Let the six t-shirt sizes be ordered as:
$ s_0 = \text{S},\ s_1 = \text{M},\ s_2 = \text{L},\ s_3 = \text{XL},\ s_4 = \text{XXL},\ s_5 = \text{XXXL} $
Let $ c = (c_0, c_1, c_2, c_3, c_4, c_5) \in \mathbb{N}^6 $ be the vector of available t-shirt counts for each size.
Let $ n \in \mathbb{N}^+ $ be the number of participants.
For each participant $ i \in \{1, \dots, n\} $, let $ A_i \subseteq \{0,1,2,3,4,5\} $ be the set of acceptable sizes, where:
- $ |A_i| = 1 $ if the participant requested a single size,
- $ |A_i| = 2 $ and $ A_i = \{j, j+1\} $ for some $ j \in \{0,1,2,3,4\} $ if the participant requested two neighboring sizes.
**Constraints:**
We seek an assignment function $ f: \{1, \dots, n\} \to \{0,1,2,3,4,5\} $ such that:
1. $ f(i) \in A_i $ for all $ i \in \{1, \dots, n\} $,
2. $ \left| \{ i \mid f(i) = j \} \right| \leq c_j $ for all $ j \in \{0,1,2,3,4,5\} $.
**Objective:**
Determine whether such an assignment $ f $ exists. If yes, output one such assignment; otherwise, output "NO".