#include <iostream>
#include <queue>
using namespace std;
#define LL long long
LL n, k;
LL w;
class node
{
public:
    LL w;
    LL depth;
};
class compare
{
public:
    bool operator()(node a, node b)
    {
        if (a.w == b.w)
        {
            return a.depth > b.depth;
        }
        return a.w > b.w;
    }
};
int main()
{
    priority_queue<node, vector<node>, compare> pq;
    LL len = 0ll;
    cin >> n >> k;
    for (int i = 0; i < n; ++i)
    {
        cin >> w;
        pq.push({w, 0});
    }
    for (int i = 0; i < (n - 1) % (k - 1); ++i)
    {
        pq.push({0, -1000000});
    }
    while (pq.size() > 1)
    {
        LL max_depth = -1000000;
        LL tot_w = 0ll;
        for (int i = 0; i < k; ++i)
        {
            node a = pq.top();
            tot_w += a.w;
            max_depth = max(max_depth, a.depth);
            pq.pop();
        }
        len += tot_w;
        max_depth ++;
        pq.push({tot_w, max_depth});
    }
    node a = pq.top();
    cout << len << endl;
    cout << a.depth << endl;
    return 0;
}