#include <fstream>
#include <algorithm>
using namespace std;
int n, k, i, maxim, nrt, j, s, sol, x;
int v[16001];

int main () {
    ifstream fin ("transport.in");
    ofstream fout("transport.out");
    fin>>n>>k;
    for (i=1;i<=n;i++) {
        fin>>v[i];
        if (v[i]>maxim)
            maxim=v[i];
    }

    nrt=0;
    for (;;) {
        for (j=1;j<=n;j++) {
            s+=v[j];
            if (s>maxim) {
                nrt++;
                s=v[j];
            }
        }
        if (s<=maxim)
            nrt++;

        if (nrt==k) {
            sol=maxim;
            break;
        }
        nrt=0;
        maxim++;
        s=0;
    }

    fout<<sol<<" "<<nrt;
    return 0;
}