def combinations_colors(l, n):
    if n < 0:
        return []
    if n == 0:
        return [[]]
    if not l:
        return []
    result = []

    def backtrack(start, path):
        if len(path) == n:
            result.append(path[:])
            return
        for i in range(start, len(l)):
            path.append(l[i])
            backtrack(i, path)
            path.pop()

    backtrack(0, [])
    return result