from copy import deepcopy
MOD = 10 ** 9 + 7

def matpow(A, B, w):
    l = len(A)
    while w:
        if w & 1:
            C = [0] * l
            for i in range(l):
                for j in range(l):
                    C[i] += A[i][j] * B[j]
                    C[i] %= MOD
            B = C.copy()
        C = [[0] * l for _ in range(l)]
        for i in range(l):
            for j in range(l):
                for k in range(l):
                    C[i][j] += A[i][k] * A[k][j]
                    C[i][j] %= MOD
        A = deepcopy(C)
        w >>= 1
    return B

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

if k <= 10 ** 6:
    A = [0] + A
    cum = A[:]
    for i in range(1, n + 1):
        cum[i] += cum[i - 1]
    for _ in range(n + 1, k + 1):
        A.append((cum[-1] - cum[-n - 1]) % MOD)
        cum.append((cum[-1] + A[-1]) % MOD)
    print(A[-1], cum[-1])
    
else:
    B = A[::-1] + [0]
    A = [[0] * (n + 1) for _ in range(n + 1)]
    for i in range(n):
        A[0][i] = 1
        A[i + 1][i] = 1
    A[n][n] = 1
    B = matpow(A, B, k - n)
    print(B[0], sum(B) % MOD)