n, k = map(int, input().split())
nums = list(map(int, input().split()))


def fibo(n, k, nums):
    if k <= n: return nums[k], sum(nums[:k])
    c = n + 1
    sk = sum(nums) + sum(nums[-n:])
    nums += [sum(nums[-n:])]
    while c < k:
        last = (nums[-1] * 2) - nums[0]
        print(last)
        sk += last
        nums = nums[1:] + [last]
        c += 1
    return nums[-1], sk

fk, sk = fibo(n, k, nums)
print(fk, sk)