Return Subsets Sum to K Problem Statement

Given an integer array 'ARR' of size 'N' and an integer 'K', return all the subsets of 'ARR' which sum to 'K'.

Explanation:

A subset of an array 'ARR' is a tuple that can be obtained from 'ARR' by removing some (possibly all) elements of 'ARR'.

Note:

• The order of subsets is not important.
• The order of elements in a particular subset should be in increasing order of the index.

Input:

The first line of input contains an integer 'N', which denotes the size of the array. The second line contains 'N' single-space separated integers representing the elements of the array. The third line contains a single integer 'K', which denotes the integer to which the subsets should sum to.

Output:

For each test case, print single-space separated integers of a subset of 'ARR' having sum = 'K'. The output of each test case will be printed in a separate line.

Example:

Input:

3
1 2 3
3

Output:

1 2
3

Constraints:

• 1 <= 'N' <= 16
• - (10 ^ 6) <= ARR[i] <= (10 ^ 6)
• - 16 * (10 ^ 6) <= 'K' <= 16 * (10 ^ 6)
• Where 'ARR[i]' denotes the value for 'ith' element of the array 'ARR' and 'K' is the given sum.

Time Limit: 1 sec.