Given an expression you’ve to print the result in the required format.

Input

The first line is an integer t which denotes the number of test cases. Each test case consists of an expression which has a number followed by ‘-‘  followed by another number(no space in between them)

Output

For each test case print the result as shown in the example test case. The number of ‘-‘(dashes) should be equal to the maximum of number of non-space characters to the line above it and below it. {in case 1, max("-11111".length(), "52334122".length()) = 8 }

Everything should be right aligned.

Note

This problem uses the exact judge. (You must not print any unnecessary spaces or new lines). Output should not contain any empty lines except the EOF.

You must print a new line after the last test case. (Similar to other test cases. Just to simplify)

Constraints

• The first number is always greater than or equal to the second number.
• Both numbers can have an at most of 100 digits.

Example

Input:
4
52345233-11111
9999-9999
82930-79934
10000-99

Output:
52345233
  -11111
--------
52334122
 9999
-9999
-----
    0
 82930
-79934
------
  2996
10000
  -99
 ----
 9901