### COCI 2007/2008, Croatian Regional

While browsing a math book, Mirko found a strange equation of the form A=S. What makes the equation strange is that A and S are not the same. Mirko realized that the left side of the equation should have addition operations between some pairs of digits in A.

Write a program that inserts the smallest number of addition operations on the left side to make the equation correct. The numbers in the corrected equation may contain arbitrary amounts of leading zeros.

### Input

The first line contains the equation in the form A=S.

A and S will both be positive integers without leading zeros. They will be different.

A will contain at most 1000 digits.

S will be less than or equal to 5000.

Note: The input data will guarantee that a solution, although not necessarily unique, will always exist.

### Output

Output the corrected equation. If there are multiple solutions, output any of them.

### Input

`143175=120`

### Output

`14+31+75=120`

### Input

`5025=30`

### Output

`5+025=30`

### Input

`999899=125`

### Output

`9+9+9+89+9=125`

Point Value: 17 (partial)
Time Limit: 1.00s
Memory Limit: 64M