#include using namespace std; using ll = long long; const ll MOD = 1e9 + 7; void inc(const vector& A, const vector& B, vector& res, const ll MOD) { int N = (int)A.size(); res[0] = (B[N - 1] * A[0]) % MOD; for (int i = 1; i < N; i++) { res[i] = (B[i - 1] + B[N - 1] * A[i]) % MOD; } }; vector kitamasa(const vector& A, ll K, const ll MOD) { int N = (int)A.size(); vector> C(N, vector(N)); vector ret(N, 0); ret[0] = 1; int cnt = 63; while (((K >> --cnt) & 1) == 0) ; cnt++; while (cnt-- > 0) { C[0] = ret; for (int i = 0; i < N - 1; i++) { inc(A, C[i], C[i + 1], MOD); } for (int i = 0; i < N; i++) { ret[i] = 0; for (int j = 0; j < N; j++) { (ret[i] += (C[0][j] * C[j][i])) %= MOD; } } if ((K >> cnt) & 1) { inc(A, ret, C[0], MOD); ret = C[0]; } } return ret; } int main() { int N; ll K; cin >> N >> K; vector A(N + 1); for (int i = 0; i < N; i++) { cin >> A[i + 1]; A[i + 1] += A[i]; } vector R(N + 1, 0); R[0] = MOD - 1; R[N] = 2; auto V = kitamasa(R, K, MOD); ll FK1 = 0; for (int i = 0; i < N + 1; i++) { (FK1 += V[i] * A[i]) %= MOD; } V = kitamasa(R, K - 1, MOD); ll FK0 = 0; for (int i = 0; i < N + 1; i++) { (FK0 += V[i] * A[i]) %= MOD; } cout << (FK1 - FK0 + MOD) % MOD << " " << FK1 << endl; }