#include <bits/stdc++.h>
#define int long long
#define lowbit(x) x & (-x)
using namespace std;
const int mod = 1000000007;

int qpow(int x, int m) {
    int res = 1;
    while(m) {
        if(m % 2) res =res * x % mod;
        m >>= 1;
        x = x * x % mod;
    }
    return res;
}

void solve() {
    int n, m; cin >> n >> m;
    vector<int>a(n + 1);
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    int x = n;
    while(m--) {
        x = x + x * 2 % mod;
    }
    cout << x << endl;
    int res1=0,res2 = 0;
    int tmp = x;
    for(int i = 1; i <= n; i++) {
        res1 = res1 + a[i] * tmp % mod;
        tmp-=2;
    }
    tmp = x;
    for(int i = n; i >= 1; i--) {
        res2 = res2 + a[i] * tmp % mod;
        tmp-=2;
    }
    cout << max(res1, res2) << endl;
}


signed main() {
	ios::sync_with_stdio(false);
	int tt = 1;
	// cin >> tt;
	while (tt--) {
		solve();
	}
}