Solution
First we will find if there exists solution(s) starting from first candidate value and that value must be present in the solution one or more times.
We will start iterating over the candidate values and check if summing up those values lead to a solution. If at any point of iteration we exceed the target value, then we backtrack and try out other candidate values. This process continues till we find a solution.
Then we will move forward and try to find all solution(s) starting from second candidate value and again that value must be present in the solution. We will follow the same steps as described above.
See the implementation below.