// luogu-judger-enable-o2

 #include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<queue>

 using namespace std;

 #define MAXN 1000010

 #define max(i,j) ((i)>(j)?(i):(j))

 #define int long long

 int n,ans,k;

 struct NODE{

     int w,h;

 } a[MAXN];

 struct cmp{

     bool operator()(NODE x,NODE y){　

         if(x.w!=y.w) return x.w>y.w;　 // 先按代价大小排序

         else return x.h>y.h;　　　　　　// 再按子树深度排序

     }

 };

 inline int read(){

     int x=; char c=getchar();

     while(c<''||c>'') c=getchar();

     while(''<=c&&c<='') { x=(x<<)+(x<<)+c-''; c=getchar(); }

     return x;

 }

 priority_queue< NODE, vector < NODE > , cmp > q0,q;

 #undef int

 int main()

 #define int long long

 {

     n=read(); k=read();

     int x; NODE p0;

     p0.w=; p0.h=;

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

         x=read(); NODE p;

         p.w=x; p.h=; q0.push(p);

     }

     q=q0; ans=;

     int top=;

     if((n-)%(k-)!=) top=k--(n-)%(k-);

     for(int i=;i<=top;i++) q.push(p0);

     while(q.size()>){

         NODE s=p0;

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

             NODE b=q.top(); q.pop();

             ans+=b.w; s.w+=b.w; s.h=max(s.h,b.h);

         }

         s.h++;

         q.push(s);

     }

     NODE t=q.top();

     printf("%lld\n%lld",ans,t.h-);

     return ;

 }