#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll MOD = 1e9 + 7;

ll hatvany(ll a){
    ll vissza = 1;
    ll akt = 2;

    for(ll i = 0; i < 31; i++){
        if(a & (1 << i)){
            vissza *= akt;
            vissza %= MOD;
        }

        akt *= akt;
        akt %= MOD;
    }

    return vissza;
}

int main()
{
    ll n, k;
    cin >> n >> k;
    k--;

    vector<ll> alap(n);
    for(ll &x : alap) cin >> x;

    vector<ll> pref(n + 1);
    for(ll i = 1; i <= n; i++){
        pref[i] = pref[i - 1] + alap[i - 1];
    }

    ll l = 0, r = k - 1;
    ll elol = 0;
    while(l <= r){
        ll mid = (l + r) / 2; // aki balra megy

        ll balra = pref[mid + 1];
        ll jobbra = pref[k + 1] - pref[mid + 1];

        if(balra <= jobbra){
            elol = mid;
            l = mid + 1;
        } else{
            r = mid - 1;
        }
    }


    l = k + 1, r = n - 1;
    ll hatul = 0;
    while(l <= r){
        ll mid = (l + r) / 2; // aki jobbra megy

        ll balra = pref[mid + 1];
        ll jobbra = pref[n] - pref[mid];

        if(balra >= jobbra){
            hatul = mid;
            r = mid - 1;
        } else{
            l = mid + 1;
        }
    }

    cout << elol << " " << hatul << "\n";

    elol = hatvany(elol + 1);
    hatul = hatvany(n - hatul);

    cout << (elol * hatul) % MOD << "\n";
}