#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

int main()
{
    int n, k;
    vector<int>a;

    cin >>n>>k;

    for (int i=0; i<n; ++i)
    {
        int x;
        cin >>x;
        a.push_back(x);
    }

    sort(a.begin(), a.end());

    int zbr=0;
    int x=a.size()-1;

    while (x>=0)
    {
        x-=k-1;
        if (x>=0)
            zbr+=a[x];
        --x;
    }

    cout <<zbr<<" "<<floor(n/k);

    return 0;
}