Combination Sum

Given an array of distinct integers `candidates` and a target integer `target`, return a list of all unique combinations of `candidates` where the chosen numbers sum to `target`. You may return the combinations in any order. The same number may be chosen from `candidates` an unlimited number of times. Two combinations are unique if the frequency of at least one of the chosen numbers is different. ### Constraints - `1 <= candidates.length <= 30` - `2 <= candidates[i] <= 40` - All elements of `candidates` are distinct. - `1 <= target <= 40` ### Input Format - Line 1: An integer `target`. - Line 2: Space-separated integers representing `candidates`. ### Output Format Print each combination on a new line with space-separated elements sorted ascending. Combinations are sorted in lexicographical order.