Incorrect addition
Volodya wrote a program that adds two numbers in a column. Unfortunately, he did not figured out how to move a unit from one level to the next. Therefore, the program was implemented as follows. First she puts the last digits of both numbers and writes the result as if it is unambiguous, and if it is a double-digit. The program then adds the penultimate digit of both numbers and the result of adding attributes to the left to the result of the previous addition. The process is repeated for all bits. If the same number of digits less than the other, the program places the zeros in the corresponding discharges for a shorter number.
Fyodor Volodya wants to prove that his way of addition does not have the property of associativity. In particular, Fyodor argues that there are three numbers, which are important for the order in which they are added. Fyodor gave even an example of three such numbers.
Need to write a program that helps Fede and Volodya determine whether it was true the assertion that, adding three numbers given in a different order, you can get different amounts.
Input
The input file contains one line of three integers a, b and c (1 ≤ a, b, c ≤ 1 000 000). All numbers in the row are separated by a space.
Output
In the first line of the output file should display the word YES, if these three numbers can be folded in different ways and get different amounts. Otherwise, you must remove the word NO.
In the next line in the output file, you must remove all possible amounts that can be obtained by adding the numbers a, b and c. The amounts should be placed one on line and in order of increasing energy.