#include<bits/stdc++.h>

using namespace std;

#define fi first

#define sc second

#define il inline

#define gc getchar()

#define mp make_pair

#define ll long long

#define int long long

#define P pair<ll,int>

#define ri register int

#define rb register bool

#define rc register char

#define rp(i,x,y) for(ri i=x;i<=y;++i)

#define my(i,x,y) for(ri i=x;i>=y;--i)

#define lb(x) lower_bound(st+1,st+st_cnt+1,x)-st

int n,K;

ll as;

priority_queue< P,vector<P>,greater<P> >Q;

il int read()

{

    rc ch=gc;ri x=;rb y=;

    while(ch!='-' && (ch>'' || ch<''))ch=gc;

    if(ch=='-')ch=gc,y=;

    while(ch>='' && ch<='')x=(x<<)+(x<<)+(ch^''),ch=gc;

    return y?x:-x;

}

signed main()

{

    //freopen("2168.in","r",stdin);freopen("2168.out","w",stdout);

    n=read();K=read();rp(i,,n)Q.push(mp(read(),));while((n-)%(K-))Q.push(mp(,)),++n;

    while((int)Q.size()>=K)

    {

        P nw=mp(,);

        rp(i,,K)

        {

            P tmp=Q.top();Q.pop();nw.fi+=tmp.fi;nw.sc=max(nw.sc,tmp.sc+);

        }

        Q.push(nw);as+=nw.fi;

    }

    printf("%lld\n%lld\n",as,Q.top().sc);

    return ;

}