Shopping in Mars

def solve(____):
    import bisect
    nums = list(map(int, str(____).split(____)))
    target = int(____)
    n = len(____)
    prefix = [____] * (____)
    for i in range(____):
        prefix[i+____] = prefix[i] + nums[i]
    results = []
    min_diff = float(____)
    for i in range(____, n+____):
        t = prefix[i-____] + target
        j = bisect.bisect_left(____)
        for jj in [j-____, j]:
            if i <= jj <= n:
                diff = abs(____)
                if diff < min_diff:
                    min_diff = diff
                    results = [(____)]
                elif diff == min_diff:
                    results.append((____))
    for a, b in sorted(set(____)):
        print(str(____) + "____" + str(____))