Equal sums (2) P82660

Write a program that, given an integer number $s$ and $n$ integer numbers $x_1, \dots, x_n$, prints the subset (maybe with repeated numbers, but using every $x_i$ at most once) lexicographically largest among those whose sum is $s$.

Input

Input consists of an integer number $s$, followed by a number $n > 0$, followed by $x_1, \dots, x_n$.

Output

Print, with the elements sorted non-increasingly, the subset that is greatest in lexicographical order among those that can be made up with $x_1, \dots, x_n$ and whose sum is $s$. If there is none, print “no solution”.

Hint

Sort the given numbers.