#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,i,j,v[17000];
long long t,transporturi,incarcat,maxim, s;
int main () {
    fin>>n>>k;
    for (i=1;i<=n;i++) {
        fin>>v[i];
        if (v[i]>maxim)
            maxim=v[i];
    }
    for (s=maxim; ;s++) {
        transporturi=1;
        incarcat=0;
        for (i=1;i<=n;i++) {
            incarcat+=v[i];
            if (incarcat>s) {
                incarcat=v[i];
                transporturi++;
            }
        }
        if (transporturi<=k) {
            fout<<s;
            return 0;
        }
    }
}