How to find all combinations of sum of elements of subarrays?

Question

Python

mas = [[1,2], [1,2,3], [1,2]

Visually

As an example, it is necessary to find all possible combinations of the sum of the number 6 from various subarrays.
6:
1) 1, 3, 2
2) 2, 2, 2
3) 2, 3 1
...
So far, I imagine it in the form of vectors with finding all possible options, but I can’t figure out the implementation. I understand that it is necessary to dig towards recursive functions. I would be very grateful for your help :)

Answer 1

https://www.youtube.com/watch?v=p8SDPaX1wgw

Answer 2

You need to run a monadic evaluation on the list. If the Pythonists don't answer, then ask the Haskellists. (I myself decided to take a course on Stepik on Haskell for the third time, because monads are a quiet horror).