1493 H


Submit solution

Points: 100
Time limit: 20.0s
Memory limit: 32M

Problem types
Allowed languages
C, C++, Java, Python

Description

Swap cols 2 and 4 Swap rows 2 and 3

     99   6  2  9                99   6  2  9


      7   1  4  5    ->           3  11 10  8


      3  11 10  8                 7   1  4  5

Input

The input consists of several instances, each of them consisting of a single line. Each line of the input contains two numbers X and Y in Fibonacci base separated by a single space. Each of the numbers has at most 40 digits. The end of input is not marked in any special way.

Output

The output for each instance should be formatted as follows:

The first line contains the number X in the canonical representation, possibly padded from left by spaces. The second line starts with a plus sign followed by the number Y in the canonical representation, possibly padded from left by spaces. The third line starts by two spaces followed by a string of minus signs of the same length as the result of the addition. The fourth line starts by two spaces immediately followed by the canonical representation of X + Y. Both X and Y are padded from left by spaces so that the least significant digits of X, Y and X + Y are in the same column of the output. The output for each instance is followed by an empty line.

Sample

Input

11101 1101
1 1

Output

100101
+   10001
  -------
  1001000

   1
+  1
  --
  10

Comments

There are no comments at the moment.