Combination Sum Finder

Given an array of distinct integers and a target sum, find all unique combinations of the integers that can be summed to the target. Each number in the array may be used an unlimited number of times. The output consists of lists of combinations. Input format: The first line contains space-separated integers followed by an integer target on the last line. Output format: A list of lists representing all unique combinations. Example: Input: 2 3 6 7 7 Output: [[7]]