def solve_2(l):
    """
    Solution to AoC 2020 day2, part 2.
    """
    for i in range(len(l)):
        for j in range(i, len(l)):
            for k in range(j, len(l)):
                if l[i] + l[j] + l[k] == 2020:
                    return l[i] * l[j] * l[k]