题目描述
Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement ofthe payment: foreach bill, she must pay the exact amount. Since she has as many as104 coins with her, she definitely needs your help. You are supposed to tell her, forany given amount of money, whether ornot she can find some coins to pay forit.
输入描述:
Each input filecontainsone test case. For eachcase, thefirstlinecontains2 positive numbers: N (<=104, the total numberof coins) and M(<=102, the amount of money Eva has to pay). The secondlinecontains N face values ofthe coins, which are all positive numbers. All the numbers inaline are separated byaspace.
输出描述:
For each test case, print inonelinethe face values V1 <= V2 <= ... <= Vk such that V1 + V2 + ... + Vk = M. All the numbers must be separated byaspace, and there must be no extra spaceattheendoftheline. Ifsuchasolutionisnotunique, outputthesmallestsequence. Ifthereisnosolution, output "NoSolution" instead.
Note: sequence {A[1], A[2], ...} is said to be "smaller" than sequence {B[1], B[2], ...} if there exists k >= 1 such that A[i]=B[i] for all i < k, and A[k] < B[k].
输入例子:
8959872341
输出例子:
135