For a sequence of N integers A
1, A
2, ... , A
N, we can calculate their sum S and product P easily. With given N, S and P, can you find out the sequence A
1, A
2, ... , A
N?
The input only contains a line with three integers N, S and P. Here N is positive and not more than 1000000, and the absolute values of S and P do not exceed 150000000.
Just output "No solution" if there is no such sequence, or you may output any solution with N integers A
1, A
2, ... , A
N, separated by just one space.