def cartesian_product(max_len: List[int]):
    n = len(max_len)
    stack = [0] * n
    deep = n
    while True:
        if deep == n - 1:
            print(stack)
        if stack[-1] + 1 < max_len[deep]:
            stack[-1] += 1
            if deep < n - 1:
                stack.append(0)
                deep += 1
        else:
            stack.pop()
            deep -= 1
            if deep < 0:
                break