Jeju Chocolate Guard

Last week, a teacher who visited Jeju Island hid Jeju chocolates in the refrigerator and has been eating them in secret.

Photo 1. A photo of the inside of the teacher's actual refrigerator

Sharp-eyed students noticed and stole some of the chocolates! The teacher wants to write the number of remaining chocolates on a sticky note so that students stop eating them. Students could change the number, so the teacher will write it according to a specific rule.

There are 5 kinds of chocolate: Hallabong (H), tangerine (T), Baengnyeoncho (C), kiwi (K), and green tea (G).

The rule for writing the remaining count is as follows.

1. On the first line, write the total number of remaining chocolates, followed directly by 7H (a word that renders the Korean counter 개 in ASCII characters).
   • Write the total in the base equal to the ones digit of the total from the previous step.
   • If the ones digit of the previous total is 0 or 1, write it in decimal.
2. On the second line, write the letter for each kind in order of remaining count, largest first, with no spaces.
   • Do not write the letter for a kind with 0 remaining.
   • If several kinds have the same count, the one whose letter comes first alphabetically goes first.
   • If the total remaining count is 0, write NULL.

Write a program that prints the counts to put on the sticky note.

The first line contains the remaining counts of each kind $H$, $T$, $C$, $K$, $G$. $H$, $T$, $C$, $K$, $G$ are the remaining counts of Hallabong, tangerine, Baengnyeoncho, kiwi, and green tea chocolates, respectively.

The second line contains the number of times chocolates are eaten, $M$.

From the third line through line $M+2$, each line gives the number of each kind eaten in one eating event: $h_i$, $t_i$, $c_i$, $k_i$, $g_i$. These are the numbers of Hallabong, tangerine, Baengnyeoncho, kiwi, and green tea chocolates eaten.

Print the output in the format described in the problem, using a total of $M \times 2$ lines.

• $1 \le H, T, C, K, G \le 1\,000\,000$
• $1 \le M \le 1\,000$
• $0 \le h_i \le H$
• $0 \le t_i \le T$
• $0 \le c_i \le C$
• $0 \le k_i \le K$
• $0 \le g_i \le G$
• The sum of eaten chocolates of each kind is guaranteed to be less than or equal to the initial count of that kind.