1. Each puzzle is made of a left operand, an operator, a right operand, an equal sign, and a result. The two operands and the result are numbers, made of one or more digits, and is less than 231.

2. The operator and the equal sign cannot be changed. You're only allowed to move sticks making up the digits.

3. You can neither remove digits completely nor introduce new ones. (i.e. You can only alter the digits.)

4. Leading zeros are allowed in both the input and output. Leading zeros in the output must be printed.

5. Each puzzle specifies the number of required moves. Your solution must move as many sticks as specified. A stick is moved at most once; It cannot be moved again. If a stick is moved, its original place must remain vacant. (i.e. you cannot move another stick to that place.)

6. When solving a puzzle involving division, the division must be an exact integer division, i.e. no remainder.

7. Digits are "written" as follows:

Input

A op B = R (n)

The end of the test cases is indicated by a separate line having the word "EOF" (without the quotes.)

Output

k._result

Where k is the puzzle number (starting at 1,) _ is a single space, and result is the equation after solving the puzzle. result includes no spaces.

In the case of multiple solutions, print just one. If the puzzle can't be solved, print "UNSOLVABLE" (without the quotes) as the result.

Sample Input

6 + 1 = 12 (1)
81 * 8 = 1 (3)
5 - 1 = 4 (1)
EOF

Sample Output

1. 5+7=12
2. 01*3=3
3. UNSOLVABLE

Note: Special judge problem, you may get "Wrong Answer" when output in wrong format.