#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
#include<bitset>

using namespace std;
typedef long long ll;
#define i_7 1000000007
#define i_5 1000000005

ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
#define inf 100000000/*10^8*/
/*#define rep(i,l,r) for(int i=l;i<=r;i++)*/
const double EPS=1E-8;

////////////////////////////////////////

#define rep(i,l,r) for(ll i=l;i<=r;i++)
int main() {
    ll n,k;cin>>n>>k;
    ll a[n];rep(i,0,n-1)cin>>a[i];
    if(k<=1000000){
        ll b[k];
        ll all=0,sum=0;
        rep(i,0,n-1){
            b[i]=a[i];
            all=mod(all+b[i]);
            sum=mod(sum+b[i]);
            /*cout<<all<<" "<<sum<<endl;*/
        }
        rep(i,n,k-1){
            b[i]=sum;
            sum=mod(sum+b[i]-b[i-n]);
            all=mod(all+b[i]);
            /*cout<<all<<" "<<sum<<endl;*/
        }
        cout<<b[k-1]<<" "<<all<<endl;
    }
    
    
    return 0;
}