Equal sums (1) P40685

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

Input

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

Output

Print all the subsets whose sum is $s$ that can be made up with $x_1, \dots, x_n$.

Information about the checker

You can print in any order both the solutions and the elements inside each solution.

Hint

For this exercise, simple backtracking solutions are accepted. No optimizations are required.