// Problem: P4 - Homeric Epics
// Contest: DMOJ - NOI '15
// URL: https://dmoj.ca/problem/noi15p4
// Memory Limit: 512 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")

using namespace std;

#define lg long long
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

const lg N = 2e5+5;

lg tr[N], par[N];
priority_queue<pair<lg, lg>> pq;

int main()
{
	fastio;
	lg n, k;
	cin >> n >> k;
	lg id = n;
	while(k > 2 && id%(k-1) != 1)	
	{
		pq.push({0, id});
		id++;
	}
	for(int i = 0; i < n; i++)
	{
		cin >> tr[i];
		pq.push({-tr[i], -i});
	}
	while(pq.size() > 1)
	{
		lg s = 0;
		for(int i = 0; i < k; i++)
		{
			lg u = -pq.top().second;
			s += tr[u];
			pq.pop();
			par[u] = id;
		}
		tr[id] = s;
		pq.push({-s, -id});
		id++;
	}
	lg root = -pq.top().second;
	lg ans = 0, mxm = 0;
	for(int i = 0; i < n; i++)
	{
		lg idx = i, cur = 0;
		while(idx != root)
		{
			cur++;
			idx = par[idx];
		}
		ans += cur*tr[i];
		mxm = max(mxm, cur);
	}
	cout << ans << '\n' << mxm;
	
    return 0;
}

/*
                6
            5       2
        3      4   
            0     1
            
0: 010
1: 011
2: 1
3: 00

0: 002 3
1: 001 3
2: 02  6
3: 000 9
4: 1   9
5: 01  18

*/