import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

md = 10 ** 9 + 7
def main():
    def mm(aa, bb):
        res = [0] * (n * 2 - 1)
        for i, a in enumerate(aa):
            for j, b in enumerate(bb):
                res[i + j] = (res[i + j] + a * b) % md
        for i in range(n, 2 * n - 1):
            c = res[i]
            ffi = ff[i]
            for j in range(n):
                res[j] = (res[j] + c * ffi[j]) % md
        return res[:n]

    def v(x,base):
        bb = ff[x % bn][:]
        x //= bn
        while x:
            if x & 1: bb = mm(bb, base)
            base = mm(base, base)
            x >>= 1
        return sum(a * f % md for a, f in zip(bb, f0)) % md

    _, t = MI()
    aa = LI()

    n = len(aa) + 1
    coff = [-1] + [0] * (n - 2) + [2]
    f0 = [aa[0]]
    for x in range(1, n - 1):
        f0.append((f0[-1] + aa[x]) % md)
    f0.append(f0[-1] * 2 % md)
    ff = [[0] * n for _ in range(2 * n - 1)]
    for i in range(n): ff[i][i] = 1
    for i in range(n, 2 * n - 1):
        ffi = ff[i]
        for j, c in enumerate(coff, i - n):
            ffj = ff[j]
            for k in range(n): ffi[k] = (ffi[k] + c * ffj[k]) % md
    bn = 1 << (n - 1).bit_length()
    base = ff[bn]

    print((v(t - 1,base) - v(t - 2,base)) % md, v(t - 1,base))

main()