Given a setA set is a collection of distinct objects. of $n$ positive integers, find all the possible subsets of integers that sum up to a number k.

Constraints:

• $1 \leq n \leq 10$

• $1 \leq x \leq 100$, where $x$ is any member of the input set

• $1 \leq$k$\leq 10^3$