How should I reduce the memory usage of a large cartesian product with repeating digits?

Question

In Python3, given a list of numbers [1, 1, 2, 3] I am to return all permutations with repeating digits up to a certain length of numbers. So we will say x = 3, meaning the