#include<bits/stdc++.h>

using namespace std;

#define MAXN 100010

struct info

{

        long long w,s;

        friend bool operator < (info a,info b)

        {

                return (a.w != b.w) ? (a.w > b.w) : (a.s > b.s);

        }

};

int i;

long long w[MAXN];

info tmp;

priority_queue< info > q;

long long ans1,val,mx,n,k,ans2;

int main()

{

        scanf("%lld%lld",&n,&k);

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

        {

                scanf("%lld",&w[i]);

                q.push((info){w[i],});

        }

        while ((n - ) % (k - ) != )

        {

                q.push((info){,});

                n++;

        }

        while (q.size() >= k)

        {

                val = ; mx = ;

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

                {

                        tmp = q.top();

                        q.pop();

                        val += tmp.w;

                        mx = max(mx,tmp.s);

                }

                ans1 += val;

                ans2 = max(ans2,mx+);

                q.push((info){val,mx+});

        }

        printf("%lld\n%lld\n",ans1,ans2);

        return ;

}