Combination Sum

Given distinct positive candidate numbers and a target, print all unique combinations where chosen numbers sum to the target. Each candidate may be used any number of times. Input format: - First line: n target - Second line: n distinct positive integers Print each combination in nondecreasing order, one combination per line. Print combinations in lexicographic order. Print `EMPTY` if there are none.

1 <= n <= 30
1 <= candidates[i], target <= 500

4 7
2 3 6 7

2 2 3
7

3 8
2 3 5

2 2 2 2
2 3 3
3 5