#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
vector<vector<ll>> matrixmul(int l, int m, int n, vector<vector<ll>> a, vector<vector<ll>> b){
	vector<vector<ll>> c;
	for(int i=0; i<l; i++){
		vector<ll> v;
		for(int j=0; j<n; j++){
			ll x=0;
			for(int k=0; k<m; k++){
				x+=(a[i][k]*b[k][j]);
				x%=MOD;
			}
			v.push_back(x);
		}
		c.push_back(v);
	}
	return c;
}
vector<vector<ll>> matrixpow(int n, vector<vector<ll>> a, ll k){
	vector<vector<ll>> ap=a, ans;
	for(int i=0; i<n; i++){
		vector<ll> v;
		for(int j=0; j<n; j++){
			if(i==j){
				v.push_back(1);
			}else{
				v.push_back(0);
			}
		}
		ans.push_back(v);
	}
	while(k){
		if(k&1) ans=matrixmul(n, n, n, ap, ans);
		ap=matrixmul(n, n, n, ap, ap);
		k>>=1;
	}
	return ans;
}
int main()
{
	int n; ll k;
	cin>>n>>k;
	ll a[10010];
	for(int i=0; i<n; i++) cin>>a[i];
	if(n>30){
		ll f[1000010], s[1000010];
		s[0]=0;
		for(int i=1; i<=n; i++) f[i]=a[i-1], s[i]=(s[i-1]+f[i])%MOD;
		for(int i=n+1; i<=k; i++){
			f[i]=(s[i-1]-s[i-n-1]+MOD)%MOD;
			s[i]=(s[i-1]+f[i])%MOD;
		}
		cout<<f[k]<<" "<<s[k]<<endl;
		return 0;
	}
	vector<vector<ll>> mat(n+1, vector<ll>(n+1));
	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][1]=mat[n][n]=1;
	vector<vector<ll>> matp=matrixpow(n+1, mat, k-1);
	a[n]=a[0];
	ll fk=0, sk=0;
	for(int i=0; i<n+1; i++) (fk+=a[i]*matp[0][i])%=MOD;
	for(int i=0; i<n+1; i++) (sk+=a[i]*matp[n][i])%=MOD;
	cout<<fk<<" "<<sk<<endl;
	return 0;
}