# -*- coding: utf-8 -*-
# 想定解(1)

def matmult(A,B): # 正方行列A*B
	n=len(A)
	C=[[0 for i in range(n)] for j in range(n)]
	for x in range(n):
		for z in range(n):
			for y in range(n):
				C[x][y] += A[x][z]*B[z][y]
				C[x][y] %= mo;
	return list(C)

def matpow(A,p): # 正方行列A^p
	n=len(A)
	A=list(A)
	R=[[0 for i in range(n)] for j in range(n)]
	for i in range(n):
		R[i][i]=1
	while p:
		if p%2:
			R = matmult(A,R)
		A=matmult(A,A)
		p >>= 1
	return R


N,K = map(int, raw_input().strip().split())
F = map(int, raw_input().strip().split())
F.insert(0,0)

mo = 1000000007

# まずS[N]までを求める
S = [0]
for i in range(1,N+1):
	S.append((S[i-1]+F[i]) % mo)

if N > 50:
	# 累積和を使うケース
	
	# 順次F[i],S[i]を求める
	# F[i] = sum(F[i-1]...F[i-N])=S[i-1]-S[i-N-1]
	for i in range(N+1,K+1):
		F.append((S[i-1]-S[i-N-1]) % mo)
		S.append((S[i-1]+F[i]) % mo)
	
	print "%d %d" % (F[K], S[K])
	
else:
	
	# 行列累乗を使うケース
	A=[[0 for i in range(N+1)] for j in range(N+1)]
	
	# F[i] = sum(F[i-1]...F[i-N])
	for i in range(N):
		A[1][i+1] = 1
	# S[i] = S[i-1] + F[i]
	for i in range(N+1):
		A[0][i] = 1
	for i in range(N-1):
		A[i+2][i+1] = 1
	# 行列累乗
	Ap = matpow(A,K-N)
	
	# Ap * Fを求める
	RetF = 0
	RetS = S[N]*Ap[0][0]
	for i in range(1,N+1):
		RetF += Ap[1][i] * F[N+1-i]
		RetS += Ap[0][i] * F[N+1-i]
	
	print "%d %d" % (RetF % mo, RetS % mo)