#!/usr/bin/python

mod = int(1e9) + 7

def solve1(n, k, a):
    y = 0
    for i in xrange(n):
        y = (y + a[i]) % mod
    z = y
    for i in xrange(n, k):
        a.append(z)
        y = (y + z) % mod
        z = (z + z - a[i-n]) % mod
    return a[-1], y

def matmul(A, B):
    p, q = len(A[0]), len(B)
    if p != q:
        print 'len(A[0])={} len(B)={}'.format(p, q)
        return None
    rows, cols, times = len(A), len(B[0]), len(A[0])
    res = [[0 for _ in xrange(cols)] for _ in xrange(rows)]
    for r in xrange(rows):
        for c in xrange(cols):
            res[r][c] = sum(A[r][i]*B[i][c] for i in xrange(times)) % mod
    return res

def matpow(A, n):
    sz = len(A)
    res = [[1 if i==j else 0 for j in xrange(sz)] for i in xrange(sz)]
    while n > 0:
        if n & 1:
            res = matmul(res, A)
        A = matmul(A, A)
        n >>= 1
    return res

def solve2(n, k, a):
    mat = [[0] * (n+1) for _ in xrange(n+1)]
    mat[0][0] = 2
    mat[0][-1] = -1
    for i in xrange(n):
        mat[i+1][i] = 1
    powered = matpow(mat, k-n)
    s = [0] + [sum(a[:i+1]) for i in xrange(n)]
    s = zip(s[::-1])
    res = matmul(powered, s)
    res00 = res[0][0]
    res10 = res[1][0]
    return (res00 - res10) % mod, res00 % mod

n, k = map(int, raw_input().split())
a = map(int, raw_input().split())
if k <= 1e6:
    x, y = solve1(n, k, a)
else:
    x, y = solve2(n, k, a)
print x, y