#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
#include<bitset>

using namespace std;
typedef long long ll;
#define i_7 1000000007
#define i_5 1000000005

ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
#define inf 100000000/*10^8*/
#define rep(i,l,r) for(int i=l;i<=r;i++)
const double EPS=1E-8;

////////////////////////////////////////
typedef vector<ll> vec;
typedef vector<vec> mat;
mat mul(mat a,mat b){/*行列aと行列bの積*/
    mat c(a.size(),vec(b[0].size()));
    for(int i=0;i<a.size();i++){
        for(int j=0;j<b[0].size();j++){
            for(int k=0;k<a[0].size();k++){
                c[i][j]=mod(c[i][j]+a[i][k]*b[k][j]);
            }
        }
    }
    return c;
}

mat pow(mat a,ll n){/*行列aのn乗*/
    mat b(a.size(),vec(a.size()));
    for(int i=0;i<a.size();i++){
        b[i][i]=1;
    }
    while(n>0){
        if(n&1)b=mul(b,a);
        a=mul(a,a);
        n>>=1;
    }
    return b;
}
//////////////////////////////////////////
void print(mat q){
    cout<<endl;
    rep(i,0,q.size()-1){
        rep(j,0,q[0].size()-1){
            cout<<q[i][j]<<" ";
        }cout<<endl;
    }
}

int main() {
    ll n,k;cin>>n>>k;
    ll a[n+1];rep(i,0,n-1)cin>>a[i];
    if(k<=1000000){
        ll b[k];
        ll all=0,sum=0;
        rep(i,0,n-1){
            b[i]=a[i];
            all=mod(all+b[i]);
            sum=mod(sum+b[i]);
            /*cout<<all<<" "<<sum<<endl;*/
        }
        rep(i,n,k-1){
            b[i]=sum;
            sum=mod(sum+b[i]-b[i-n]);
            all=mod(all+b[i]);
            /*cout<<all<<" "<<sum<<endl;*/
        }
        cout<<b[k-1]<<" "<<all<<endl;
    }else{
        for(int i=n;i>=1;i--)a[i]=a[i-1];
        mat x(n,vec(n));
        rep(i,0,n-1){
            rep(j,0,n-1){
                if(i==0){
                    x[i][j]=1;
                }else{
                    if(i==j+1)x[i][j]=1;
                    else x[i][j]=0;
                }
            }
        }
        mat xx(n,vec(1));
        rep(i,0,n-1)xx[i][0]=a[n-i];
        xx=mul(pow(x,k-n),xx);
        cout<<xx[0][0]<<" ";
        
        
        mat y(n+1,vec(n+1));
        rep(i,0,n){
            rep(j,0,n){
                if(i==0){
                    if(j==0)y[i][j]=2;
                    else if(j==n)y[i][j]=-1;
                    else y[i][j]=0;
                }else{
                    if(i==j+1)y[i][j]=1;
                    else y[i][j]=0;
                }
            }
        }
        /*print(y);*/
        mat yy(n+1,vec(1));
        yy[n][0]=a[1];
        rep(i,1,n-1)yy[n-i][0]=mod(yy[n-i+1][0]+a[i+1]);
        yy[0][0]=0;
        rep(i,1,n)yy[0][0]=mod(yy[0][0]+2*a[i]);
       /* print(yy);*/
        mat z=pow(y,k-n-1);
        yy=mul(z,yy);
        cout<<yy[0][0]<<endl;
        
        
    }
    return 0;
}