Equation#12344
Given three strings , , and , composed of the first lowercase Latin letters a-j. You need to replace each Latin letter with a digit 0-9 such that:
Different letters are assigned different digits.
After replacing letters with digits, a+b=c holds.
a,b,c cannot start with zero.
When replacing a letter with a digit, it is simultaneously replaced in all strings. In other words: you cannot, for example, replace letter e in string with 1, and in string with 2.
Replace the letters accordingly and output these three strings with the replaced digits.
The first line of the input data contains the string (1 \leq |a| \leq 8).
The second line of the input data contains the string (1 \leq |b| \leq 8).
The third line of the input data contains the string (1 \leq |a|, |b| \leq |c| \leq 8).
Note that for any string , denotes its length.
It is guaranteed that an answer exists.
In a single line of output data, output the strings a, b, c after replacing letters with digits separated by spaces.
Example 1
There will be tests (excluding examples) for the problem, each evaluated at points.