How to implement an algorithm for finding possible combinations?

Question

Combinatorics

Hello!
Tell me how to implement the following algorithm:
There is a list of numbers, you need to find all possible combinations of obtaining a given number from these numbers by summation.
For example:
Given - 2, 5, 1, 10, 1, 6, 12, 4, 2, 1
Find combinations of obtaining 13
Output - (2; 10; 1), (6; 4; 2; 1), (6 ; 2; 2; 1; 1; 1), (10; 1; 1; 1), (10; 2; 1), (12; 1), (6; 5; 2), (6; 5; 1 ; 1), etc.