#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)
#define MAX 31

typedef long long ll;
typedef ll M[MAX][MAX];

int f[1001001], s[1001001];

void multMM(M a, M b) {
    int i, j, k;
    M c;
    rep (i,MAX) rep (j,MAX) c[i][j] = 0;
    rep (i,MAX) rep (j,MAX) rep (k,MAX) {
        c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % MOD;
        c[i][j] = (c[i][j] + MOD) % MOD;
    }
    rep (i,MAX) rep (j,MAX) a[i][j] = c[i][j];
}

void powMM(M a, ll n) {
    int i, j;
    M tmp;
    rep (i,MAX) rep (j,MAX) tmp[i][j] = i == j;
    while (n > 0) {
        if (n % 2) {
            multMM(tmp,a);
        }
        multMM(a,a);
        n /= 2;
    }
    rep (i,MAX) rep (j,MAX)
        a[i][j] = tmp[i][j];
}

void multMV(M a, int b[MAX]) {
    int i, j;
    int tmp[MAX];
    rep (i,MAX) tmp[i] = 0;
    rep (i,MAX) rep (j,MAX) {
        tmp[i] = (tmp[i] + a[i][j] * b[j]) % MOD;
        tmp[i] = (tmp[i] + MOD) % MOD;
    }
    rep (i,MAX) b[i] = tmp[i];
}

int main(void) {
    int i, n;
    ll k;
    scanf("%d%lld",&n,&k);
    if (k <= (int)1e6) {
        rep (i,n) scanf("%d",f+i);
        int sum = 0;
        rep (i,n) sum = (sum + f[i]) % MOD;
        REP (i,n,k-1) {
            f[i] = sum;
            sum = (sum + f[i] - f[i-n]) % MOD;
            sum = (sum + MOD) % MOD;
        }
        rep (i,k) s[i] = (f[i] + (i > 0 ? s[i-1] : 0)) % MOD;
        printf("%d %d\n", f[k-1], s[k-1]);
    }
    else {
        int a[MAX] {};
        M mat {};
        rep (i,n) scanf("%d",a+i+1);
        rep (i,n) a[i+1] += a[i];
        rep (i,n) mat[i][i+1] = 1;
        mat[n][0] = -1; mat[n][n] = 2;
        powMM(mat,k-n);
        multMV(mat,a);
        printf("%d %d\n",(a[n]-a[n-1]+MOD)%MOD,a[n]);
    }
    return 0;
}