Description
Let's consider arithmetic expressions (addition or subtraction) over non-negative decimal integers. The expression syntax is as follows:
the first operand;
the operator sign ('+');
the second operand;
the character '=';
the result of the operation (sum or difference, according to the operator).
The operands don't exceed 999 999 999. In case of subtraction the first operand should be greater than or equal to the second one. There are no spaces in the expression.
Upper-case Latin letters are substituted for some digits (possibly including insignificant zeroes) so that identical letters correspond to identical digits and different letters correspond to different digits. It is guaranteed that at least one such substitution is made.
The task is to restore the substituted digits.
Input
The input contains only one line with the encoded arithmetic expression.
Output
The output consists of several lines. Each line describes one substitution and contains a letter and the corresponding digit. The letter and the digit should be separated by exactly one space. The strings should be sorted in the ascending order of letters. Letters not used in the substitution should not be listed.
Sample Input
103K+G0G1=CG36
Sample Output
C 1
G 0
K 5
