Problem Statement

You have $Y$ copies of the character y, $I$ copies of the character i, and $W$ copies of the character w. By using all of these characters and arranging them in a row in any order, you can create a string $S$ of length $Y + I + W$. Let $P$ be the number of not necessarily contiguous subsequences of $S$ that are equal to yiwiy as strings, and let $Q$ be the number of contiguous substrings of $S$ that are equal to iwiwi as strings. The attractiveness of $S$ is then $AP + BQ$. Here, $A, B$ are non-negative integers given in the input, and $2$ subsequences or substrings are distinguished if and only if the positions from which the characters are taken differ. Find one string $S$ with the highest attractiveness among the strings you can create. If there are multiple candidate answers, you may output any of them.

You are given $T$ test cases; find the answer for each of them.

Constraints

• $1 \leq T \leq 10^5$
• $1 \leq Y + I + W \leq 10^6$
• $0 \leq Y, I, W$
• $0 \leq A, B \leq 10^9$
• All input values are integers.
• The sum of $Y + I + W$ over all test cases is at most $10^6$.

Input

$T$
$\text{case}_1$
$\text{case}_2$
$\vdots$
$\text{case}_T$

Here, $\text{case}_i$ denotes the input for the $i$-th case. Each case is given in the following format.

$Y\ I\ W\ A\ B$

Output

$\text{answer}_1$
$\text{answer}_2$
$\vdots$
$\text{answer}_T$

Here, $\text{answer}_i$ denotes the output for the $i$-th case. Each case is as follows.

Suppose that $S$ is one of the strings with the highest attractiveness among those you can create. Then, output in the following format.

$S$

Sample

3
2 3 2 1 1
1 2 8 100 0
6 6 3 2 5

yiwiwiy
yiwiwwwwwww
yyyiiiwwwiiiyyy