#include <iostream>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <string>
#include <limits>

using namespace std;

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

#define inf INT_MAX/3
#define INF INT_MAX/3
#define PB push_back
#define MP make_pair
#define ALL(a) (a).begin(),(a).end()
#define SET(a,c) memset(a,c,sizeof a)
#define CLR(a) memset(a,0,sizeof a)
#define pii pair<int,int>
#define pcc pair<char,char>
#define pic pair<int,char>
#define pci pair<char,int>
#define VS vector<string>
#define VI vector<int>
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define MIN(a,b) (a>b?b:a)
#define MAX(a,b) (a>b?a:b)
#define pi 2*acos(0.0)
#define INFILE() freopen("in0.txt","r",stdin)
#define OUTFILE()freopen("out0.txt","w",stdout)
#define in scanf
#define out printf
#define ll long long
#define ull unsigned long long
#define eps 1e-14
#define FST first
#define SEC second

int N, K;
vector<int> A;

void func1() {
	ll sum = 0;
	ll ret = 0;
	vector<int> F;
	for (int k = 0; k < K; ++k) {
		if (k < N) {
			F.push_back(A[k]);
			ret += F.back();
			ret %= int(10e9) + 7;
			sum += A[k];
			sum %= int(10e9) + 7;
		}
		else {
			F.push_back(sum);
			ret += F.back();
			ret %= int(10e9) + 7;
			sum -= F[k - N];
			sum += F.back();
			sum %= int(10e9) + 7;
		}
	}
	cout << F.back() << " " << ret << endl;
}

void func2() {
}

int main(void) {
	cin >> N >> K;
	REP(i, N) {
		int a; cin >> a;
		A.push_back(a);
	}

	func1();

	return 0;
}