#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
const long long nm=16005;
long long v[nm],n,k,st,dr,med,maxx,sum;
long long f(long long x)
{
    long long zi=0,s=0;
    for(int i=1;i<=n+1;i++)
    {
        s+=v[i];
        if(s>x)
        {
            if(s==v[i])
                return 0;
            s=v[i];
            zi++;
            if(zi==k or i==n+1)
                return i-1;
        }
    }
}
int main()
{
    fin>>n>>k;
    v[n+1]=1e18;
    for(long long i=1;i<=n;i++)
        {
        fin>>v[i];
        sum+=v[i];
        if(v[i]>maxx)
            maxx=v[i];
        }
    st=maxx;dr=sum;
    while(st<=dr)
    {
        med=(st+dr)/2;
        if(f(med)==n)
        {
            if(f(med-1)!=n)
            {
                fout<<med;
                return 0;
            }
            dr=med-1;
            continue;
        }
        if(f(med)<n)
            st=med+1;
        else
            dr=med-1;
    }
    return 0;
}