import strutils, sequtils

const MOD = int(1e9 + 7)

proc `%%`(a: int64, b: int64): int64 = result = (a + b) mod b
template `+%=` (a, b: int64) = a = (a + b) mod MOD
#template `-%=` (a, b: int64) = a = (a - b) mod MOD
template `+%%=` (a, b: int64) = a = (a + b) %% MOD
template `-%%=` (a, b: int64) = a = (a - b + MOD) %% MOD

proc matmul(a: seq[seq[int64]], b: seq[seq[int64]]): seq[seq[int64]] =
  var (a, b) = (a, b)
  result = newSeqWith(a.len, newSeq[int64](b[0].len))
  for i in 0.. <a.len:
    for k in 0.. <b.len:
      for j in 0.. <b[0].len:
         result[i][j] +%%= (a[i][k] * b[k][j])

proc matpow(a: var seq[seq[int64]], n: var int64): seq[seq[int64]] =
  result = newSeqWith(a.len, newSeq[int64](a.len))
  for i in 0.. <a.len:
    for j in 0.. <a.len:
      result[i][j] = if i==j: 1 else: 0
  while n > 0:
    if (n and 1) == 1: result = matmul(result, a)
    a = matmul(a, a)
    n = n shr 1

proc solve1(n: int, k: int, a: seq[int]): tuple[a: int, b: int] =
  var (k, n, a) = (k, n, a)
  var y = 0
  for i in 0.. <n:
    y +%= a[i]
  var z = y
  for i in n.. <k:
    a.add(z)
    y +%= z
#    z +%= z
#    z -%%= a[i-n]
    z = (z + z - a[i-n] + MOD) %% MOD
  result = (a[a.len-1], y)

proc solve2(n: int, k: int64, a: seq[int]): tuple[a: int, b: int] =
  var (k, n, a) = (k, n, a)
  var s = newSeqWith(n+1, newSeq[int64](1))
  s[n][0] = 0
  s[n-1][0] = a[0]
  for i in 1.. <n: s[n-1-i][0] = s[n-i][0] + a[i]
  var mat = newSeqWith(n+1, newSeq[int64](n+1))
  mat[0][0] = 2
  mat[0][n] = -1
  for i in 0.. <n: mat[i+1][i] = 1
  var times: int64 = k-n
  var powered = matpow(mat, times)
  var res     = matmul(powered, s)
  var x = res[0][0]
  var y = res[1][0]
  result = (int((x-y) %% MOD), int(x))

var
  scan = stdin.readLine.split.map(parseInt)
  n: int = scan[0]
  k: int64 = scan[1]
  a = newSeq[int](n)
scan = stdin.readLine.split.map(parseInt)
for i in 0.. <n: a[i] = scan[i]
var res: tuple[a: int, b: int]
if k <= int(1e6):
  res = solve1(n, int(k), a)
else:
  res = solve2(n, k, a)
echo res.a, " ", res.b