Balanced Chemical Equations

One cumbersome problem in chemistry is the task of making the number of atoms balanced in a chemical equation. Our problem is concerned with this.

Chemists obey these rules when they present chemical equations:

1. Each element name is abbreviated by at most two letters. The first letter is always in upper-case and the second letter if exists, is a lower-case letter (e.g. Calcium is represented by Ca, Oxygen by O, and Chlorine by Cl).

2. Each molecule is composed of a number of atoms. To represent a molecule, we concatenate the abbreviated names of its composite atoms. For example, NaCl represents Sodium Chloride. Each atom name may be followed by a frequency number. For example, Calcium Chloride CaCl2 consists of one atom of Calcium and two atoms of Chlorine. If the frequency is not given, it is assumed to be 1 (so HCl is equivalent to H1Cl1). For the sake of simplicity, you may assume that the frequency of an occurrence of an atom is at most 9 (so we do not have C11H22O11 in the problem input). Note that there may be several occurrences of the same atom in the molecule formula, like H atom in CH3COOH.

3. In ordinary chemical reactions, a number of molecules combine and result in a number of other molecules. For example a well known sample of neutralization is:

2HCl + CaO2H2 → CaCl2 + 2H2O

This means two molecules of chlorohydric acid (HCl) with one molecule of Calcium Hydroxide results in one molecule of Calcium Chloride (CaCl2) and two molecules of water.

1. In every chemical reaction, the total number of each atom in the right side of the equation equals the total number of that atom in the left side (that is why it is called an equation!).

Your task is to write a program to find appropriate coefficients x_1, x_2, …, x_{M }and y_1, y_2, …, y_{N }to balance an (imbalanced) equation like

A_1+A_2+A_3+ … +A_M → B_1+B_2+B_3+ … +B_N

in the following way:

x_1 A_1+ x_{2 }A_2+ x_{3 }A_3+ … + x_{M }A_M → y_{1 }B_1+ y_{2 }B_2+ y_{3 }B_3+ … + y_{N }BN

Input

The first line contains an integer t (1 ≤ t ≤ 10), the number of test cases. Each test case consists of a single line containing an expression like:

A_1+A_2+A_3+ … +A_{M }= B_1+B_2+B_3+ … +B_N

Each A_{i }or B_{i }is a formula of a molecule according to the rules given in items 1 and 2.

The input equations are given in a way that if they can be balanced, x_{i }and_{ }y_i_{ }coefficients can be in the range of 1 to 9. There are less than 10 molecules and there are less than 10 different types of atoms, in a given equation. Additionally, you may assume molecules contain no more than 3 different kinds of atoms. You may also assume that there is no blank character in the input file, and the maximum length of the input lines is 200 characters.

Output

The output will be one line per test case containing the list of required coefficients, separated by blank characters, in the following order:

x_{1 } x_{2 } … x_{M } y_{1 } y_{2 } … y_N

The coefficients should be integers in the range of 1..9. Obviously, there may be more than one answer for a test case. In such situations, print the answer which minimizes the number:

(This is an (M+N)-digit decimal number whose digits are x_i and y_i coefficients.) If the equation is impossible to balance, the output line should be IMPOSSIBLE.

Examples