Haskell list comprehension creating all possible combinations of values

Question

I want to create a list of lists, which contains all possible combinations of values inside the smaller lists with size n

For example, let\'s say I have the list [1,2