#include<iostream>
#include<fstream>
using namespace std;
int main()
{
    unsigned n,k,V[16001],maxim=0;
    ifstream f("transport.in");
    ofstream f1("transport.out");
    unsigned long long s=0;
    f>>n>>k;
    for (unsigned i=1;i<=n;i++)
    {
        f>>V[i];
        s+=V[i];
        if (maxim<V[i]) maxim=V[i];
    }
    unsigned i=1,nr_tr=0;
    s/=k;
    if (s>maxim) maxim=s;
    maxim--;
    while (nr_tr!=k)
    {
        nr_tr=0;
        maxim++;
        s=0;
        for (i=1;i<=n;i++)
        {
            if ((s+V[i])<=maxim)
                s+=V[i];
            else
            {
                s=0;
                i--;
                nr_tr++;
            }
        }
    }
    f1<<maxim;
    return 0;
}