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

int dp[1000010];

long long mod = (int)1e9 + 7;

void calc(int N, long long K, vector<int> A){
	long long sum2 = 0;
	long long sum = 0;
	for (int i = 0; i < N; i++)
	{
		dp[i] = A[i];
		sum += A[i];
		sum2 += A[i];
	}
	sum %= mod;
	sum2 %= mod;
	for (int i = N; i < K; i++)
	{
		dp[i] = sum;
		sum -= dp[i - N];
		sum += dp[i];
		sum %= mod;
		sum += mod;
		sum %= mod;

		sum2 += dp[i];
		sum2 %= mod;
	}
	cout << dp[K - 1] << " " << sum2 << endl;
}

vector<vector<long long>> E(int N){
	vector<vector<long long>> V(N, vector<long long>(N, 0));
	for (int i = 0; i < N; i++)
	{
		V[i][i] = 1ll;
	}
	return V;
}

vector<vector<long long>> matrixmul(vector<vector<long long>>  a, vector<vector<long long>>  b){
	int N = a[0].size();
	vector<vector<long long>> V(N, vector<long long>(N, 0));
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < N; j++)
		{
			for (int k = 0; k < N; k++)
			{
				V[i][j] += a[i][k] * b[k][j];
				V[i][j] %= mod;
			}
			V[i][j] %= mod;
		}
	}
	return V;
}

vector<vector<long long>> matrixpow(vector<vector<long long>> a, long long p){
	if (p == 0) return E(a[0].size());
	if (p % 2 == 1){
		return matrixmul(a, matrixpow(a, p - 1));
	}
	else{
		auto c = matrixpow(a, p / 2);
		return matrixmul(c, c);
	}
}



void calc2(int N, long long K, vector<int> A){
	vector<vector<long long>> V(N + 1, vector<long long>(N + 1, 0));
	for (int i = 0; i < N; i++)
	{
		if(i != 0) V[i - 1][i] = 1;
		V[N - 1][i] = 1;
		V[N][i] = 1;
	}
	V[N][N] = 1;
	long long sum = 0;
	for (int i = 0; i < N; i++)
	{
		sum += A[i];
		sum %= mod;
	}
	long long ans = 0;
	auto next = matrixpow(V, K - N);

	for (int i = 0; i < N; i++)
	{
		ans += A[i] * next[N - 1][i];
		sum += A[i] * next[N][i];
	}
	ans %= mod;
	sum %= mod;
	cout << ans << " " << sum << endl;
}

int main() {
	int N;
	long long K;
	cin >> N >> K;
	vector<int> A(N);
	for (int i = 0; i < N; i++)
	{
		cin >> A[i];
	}
	if (K <= 1000000) calc(N, K, A);
	else calc2(N, K, A);
}