Given an array of $n$ distinct positive integers, find all possible subsets of these integers such that the sum of the elements in each subset equals a given target value k.

Return a 2D array, where each inner array represents a subset whose sum equals k.

Constraints:

• $1 \leq n \leq 10$

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

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