#include <cstdio>

#include <cstring>

#include <algorithm>

#define HoN Heap::

#define make(a,b) ((Heap::V){(a),(b)})

typedef long long LL;

const int N=;

namespace Heap{

  struct V{

    LL val;int deep;

    inline friend bool operator <(V a,V b);

  }k[N];

  int len;

  inline bool operator <(V a,V b){

    return a.val<b.val||(a.val==b.val&&a.deep<b.deep);

  }

  inline bool empty(){return len==;}

  inline V top(){return k[];}

  inline int size(){return len;}

  inline void pop(){

    k[]=k[len--];register int now=;

    while(now<=(len>>)){

      int next=now<<;

      if(next<len&&k[next|]<k[next])next|=;

      if(k[now]<k[next])return;

      std::swap(k[now],k[next]),now=next;

    }

  }

  inline void push(V key){

    k[++len]=key;register int now=len;

    while(now!=&&k[now]<k[now>>])

      std::swap(k[now],k[now>>]),now>>=;

  }

}

int n,k;

LL ans;

int main(){

  scanf("%d%d",&n,&k);LL x;

  for(int i=;i<=n;++i)

    scanf("%lld",&x),HoN push(make(x,));

  if(k!=&&n%(k-)!=){

    if(n%(k-)==)HoN push(make(,)),++n;

    else{

      for(int i=;i<=k-(n%(k-));++i)

        HoN push(make(,));

      n+=n%(k-);

    }

  }

  int m=k==?n-:n/(k-);

  int max;HoN V use;

  while(m--){

    x=,max=;

    for(int i=;i<=k;++i)

      use=HoN top(),HoN pop(),x+=use.val,max=std::max(max,use.deep);

    ans+=x,HoN push(make(x,max+));

  }

  printf("%lld\n%d",ans,HoN top().deep-);

  return ;

}