Algorithm to generate subsets from multiple lists. Where each generated subset must add to a certain sum but use only one elements from each list?

Question

So given a sum of n and having k lists. Find all the subsets from k lists which add up to n. Provided you can and must use only 1 element from each list. I was asked this in