1
#include <bits/stdc++.h>
2
#define endl '\n'
3
using namespace std;
4
typedef long long ll;
5
typedef pair<ll,ll> pll;
6
int main(){
7
    ll n,k;
8
    cin>>n>>k;
9
    priority_queue<pll,vector<pll>,greater<>> pq;
10
    for(ll i=1;i<=n;i++){
11
        ll w;
12
        cin>>w;
13
        pq.push({w,0});
14
    }
15
    ll ans=0;
16
    ll ma=0;
17
    while((pq.size()-1)%(k-1)!=0)pq.push({0,0});
18
    while(pq.size()>1){
19
        ll tmp=0;
20
        ll h=0;
21
        for(ll i=0;i<k;i++){
22
            tmp+=pq.top().first;
23
            h=max(h,pq.top().second);
24
            pq.pop();
25
        }
26
        ans+=tmp;
27
        pq.push({tmp,h+1});
28
    }
29
    cout<<ans<<endl<<pq.top().second<<endl;
30
    return 0;
31
}