[Haskell-cafe] How to dynamic plan in Haskell?

Hi, I solved the question. But I could not figure out a FP style solution. Question: 1 - 9, nine numbers. Show all the possible combinations that sum up to 10. Different orders are counted as the same. For example, [1, 4, 5].