#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
const int N = 30;
ll n, k, a;
ll va[N], vb[N], vc[N], vd[N];
ll ma[N][N], mb[N][N], md[N][N];

void merge(ll (&a1)[N][N], ll (&a2)[N][N], ll (&a3)[N][N]){
  FOR(i, 0, n)FOR(j, 0, n){
    md[i][j] = 0;
    FOR(k, 0, n) md[i][j] += a1[i][k] * a2[k][j] % mod;
    md[i][j] %= mod;
  }
  FOR(i, 0, n) FOR(j, 0, n) a3[i][j] = md[i][j];
}

void prod(ll (&v1)[N], ll (&m)[N][N], ll (&v2)[N]){
  FOR(i, 0, n){
    vd[i] = 0;
    FOR(j, 0, n) vd[i] += v1[j] * m[j][i] % mod;
    vd[i] %= mod;
  }
  FOR(i, 0, n) v2[i] = vd[i];
}
void pls(ll (&v1)[N], ll (&v2)[N], ll (&v3)[N]){
  FOR(i, 0, n) v3[i] = (v1[i] + v2[i]) % mod;
}

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> k;
  ll s=0, f, fk=0;
  if(k > 1000000){
    FOR(i, 0, n){
      va[i] = 1;
      mb[i][i] = 1;
      ma[n-1][i] = 1;
    }
    FOR(i, 0, n-1) ma[i][i+1] = 1;
    k = k - n;
    while(k > 0){
      if(k & 1){
        prod(va, mb, vc);
        pls(vb, vc, vb);
        merge(mb, ma, mb);
      }
      prod(va, ma, vc);
      pls(va, vc, va);
      merge(ma, ma, ma);
      k >>= 1;
    }
    FOR(i, 0, n){
      cin >> a;
      s = (s + a + vb[i]*a) % mod;
      fk = (fk + mb[n-1][i]*a) % mod;
    }
  }else{
    queue<ll> q;
    FOR(i, 0, n){
      cin >> a;
      s += a;
      q.push(a);
    }
    f = s;
    FOR(i, n, k){
      s = (s + f) % mod;
      fk = f;
      q.push(f);
      f = (f + f - q.front() + mod) % mod;
      q.pop();
    }
  }
  cout << fk << " " << s << endl;
  return 0;
}