#include<bits/stdc++.h>
using namespace std;

#define int long long

typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ln <<endl
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

const int mod=1000000007;

int N,K;
int A[1111111];

void solve1(){
    int ret,sum=accumulate(A,A+N,0ll)%mod;
    ret=sum;
    for(int i=N;i<K;i++){
        A[i]=sum;
        ret=(ret+A[i])%mod;
        sum=(2*sum-A[i-N]+mod)%mod;
    }
    cout<<A[K-1]<<" "<<ret<<endl;
}

typedef vint vec;
typedef vector<vint>mat;
mat mul(mat A,mat B){
    mat C(A.size(),vec(B[0].size()));
    rep(i,C.size()){
        rep(j,C[0].size()){
            rep(k,A[0].size()){
                C[i][j]=(C[i][j]+A[i][k]*B[k][j])%mod;
            }
        }
    }
    return C;
}

mat matpow(mat A,int m){
    mat B(A.size(),vec(A.size()));
    rep(i,B.size())B[i][i]=1;

    for(;m;m>>=1){
        if(m&1)B=mul(B,A);
        A=mul(A,A);
    }
    return B;
}

void solve2(){
    mat C(N+1,vec(N+1)),X(N+1,vec(1));
    rep(i,N)X[N-1-i][0]=A[i];
    X[N][0]=accumulate(A,A+N,0ll);
    rep(i,N)C[0][i]=1;
    for(int i=0;i<N-1;i++)C[i+1][i]=1;
    rep(i,N+1)C[N][i]=1;

    C=matpow(C,K-N);
    X=mul(C,X);
    cout<<X[0][0]<<" "<<X[N][0]<<endl;
}

signed main(){
    cin>>N>>K;
    rep(i,N)cin>>A[i];

    if(N>30)solve1();
    else solve2();
    return 0;
}