#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

const int MOD = 1000000007;

// 行列の積
template <class T>
vector<vector<T> > matrixProduct(const vector<vector<T> >& x, const vector<vector<T> >& y)
{
    int a = x.size();
    int b = x[0].size();
    int c = y[0].size();
    vector<vector<T> > z(a, vector<T>(c, 0));
    for(int i=0; i<a; ++i){
        for(int j=0; j<c; ++j){
            for(int k=0; k<b; ++k){
                z[i][j] += x[i][k] * y[k][j];
                z[i][j] %= MOD;
            }
        }
    }
    return z;
}

// 行列の累乗
template <class T>
vector<vector<T> > matrixPower(const vector<vector<T> >& x, long long k)
{
    int n = x.size();
    vector<vector<T> > y(n, vector<T>(n, 0));
    for(int i=0; i<n; ++i)
        y[i][i] = 1; // 積の単位元

    vector<vector<T> > z = x;
    while(k > 0){
        if(k & 1)
            y = matrixProduct(y, z);
        z = matrixProduct(z, z);
        k >>= 1;
    }
    return y;
}

pair<long long, long long> solve1(const vector<int>& a, long long k)
{
    int n = a.size();
    queue<int> q;
    int sum = 0;
    for(int i=0; i<n; ++i){
        sum += a[i];
        q.push(a[i]);
    }

    pair<long long, long long> ans(-1, sum);
    for(int i=n; i<k; ++i){
        ans.first = sum;
        ans.second += sum;
        q.push(sum);
        sum += sum;
        sum -= q.front();
        q.pop();
    }
    return ans;
}

pair<long long, long long> solve2(const vector<int>& a, long long k)
{
    int n = a.size();
    vector<vector<long long> > mat(n+1, vector<long long>(n+1, 0));
    for(int i=0; i<n-1; ++i)
        mat[i][i+1] = 1;
    for(int i=0; i<n; ++i)
        mat[n-1][i] = 1;
    mat[n][0] = mat[n][n] = 1;

    mat = matrixPower(mat, k - 1);

    pair<long long, long long> ans(0, 0);
    for(int i=0; i<n; ++i){
        ans.first += mat[0][i] * a[i];
        ans.first %= MOD;
        ans.second += mat[n][i] * a[i];
        ans.second %= MOD;
    }
    ans.second += ans.first;
    ans.second %= MOD;
    return ans;
}

int main()
{
    int n;
    long long k;
    cin >> n >> k;
    vector<int> a(n);
    for(int i=0; i<n; ++i)
        cin >> a[i];

    pair<long long, long long> ans;
    if(n > 30)
        ans = solve1(a, k);
    else
        ans = solve2(a, k);
    cout << ans.first << ' ' << ans.second << endl;

    return 0;
}