#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

//#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
//#endif

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#include <array>
//#include <atomic>
#include <chrono>
//#include <condition_variable>
#include <forward_list>
//#include <future>
#include <initializer_list>
//#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <system_error>
//#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>


using namespace std;

typedef long long ll;
typedef vector<ll>vec;
typedef vector<vec>mat;

// A*Bの計算
mat mul ( mat &A , mat&B , ll M )
{
	mat C ( A.size () , vec ( B[0].size () ) );
	for( int i = 0; i < A.size (); i++ )
	{
		for( int k = 0; k < B.size (); k++ )
		{
			for( int j = 0; j < B[0].size (); j++ )
			{
				C[i][j] = ( C[i][j] + A[i][k] * B[k][j] ) % M;
			}
		}
	}
	return C;
}
// A^nの計算
mat pow ( mat A , ll n , ll M )
{
	mat B ( A.size () , vec ( A.size () ) );
	for( int i = 0; i < A.size (); i++ )
	{
		B[i][i] = 1;
	}
	while( n > 0 )
	{
		if( n & 1 ) B = mul ( B , A , M );
		A = mul ( A , A , M );
		n >>= 1;
	}
	return B;
}

//初期化
//mat A(2, vec(2));

int main ()
{
	long long int N , K;
	cin >> N >> K;
	mat A ( N + 1 , vec ( N + 1 ) );
	for( size_t i = 0; i < N - 1; i++ )
	{
		A[i][i + 1] = 1;
	}
	for( int i = 0; i < N; i++ )
	{
		A[N - 1][N - i - 1] = 1;
		A[N][i] = 1;
	}
	A[N][N] = 1;
	mat B ( N + 1 , vec ( 1 ) );
	for( size_t i = 0; i < N; i++ )
	{
		cin >> B[i][0];
	}
	for( size_t i = 0; i < N; i++ )
	{
		B[N][0] += B[i][0];
	}
	mat D = pow ( A , K - N , ( long long int )1e9 + 7 );
	mat C = mul ( D , B , ( long long int )1e9 + 7 );
	cout << C[N - 1][0] << " " << C[N][0] << endl;
	return 0;
}