Volodya wrote a program that adds two numbers column-wise. Unfortunately, he did not figure out how to correctly carry over units from one digit to the next. As a result, his program works as follows: it first adds the last digits of both numbers and writes down the result—whether it is a single-digit or double-digit number. Then, it adds the penultimate digits of both numbers and prepends this result to the left of the previous sum. This process repeats for all digits. If one number has fewer digits than the other, the program pads the shorter number with zeros in the higher digits.
Fedor wants to prove to Volodya that this method of addition is not associative. In particular, Fedor claims that there exist three numbers for which the order of addition affects the result. In fact, Fedor even presents an example of such three numbers.
You are required to write a program that helps Fedor and Volodya determine whether, by adding the given three numbers in different orders, it is possible to obtain different results.
The input file contains one line with three integers , , and (1 \leq a, b, c \leq 1\ 000\ 000). All numbers in the line are separated by spaces.
Print YES in the first line if it is possible to get different sums by adding the three given numbers in different orders. Otherwise, print NO.
In the following lines, print all possible results that can be obtained by adding , , and in every possible order, one sum per line, in increasing order.
Example 1