#include<iostream>
using namespace std;
int N,k,a[16001];
 
int bun(int c)
{
    int i=0,s=0,meh=0;
    for(i=1;(i<=N)&&(meh<=k+3);++i)
    {
 
        if(s+a[i]<=c)
            s=s+a[i];
        else
        {
            s=0;
            ++meh;
            --i;
        }
    }
    if(s!=0)
        ++meh;
    if(meh>k)
        return 0;
    else
        return 1;
}
 
int caut()
{
    int ret;
    int mij,st=1;
    int dr=256000000;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if(bun(mij)==0)
            st=mij+1;
        else
        {
            ret=mij;
            dr=mij-1;
        }
    }
    return ret;
}
int main()
{
    freopen("transport.in","r",stdin);
    freopen("transport.out","w",stdout);
    scanf("%d%d",&N,&k);
    for(int j=1;j<=N;++j)
        scanf("%d",&a[j]);
    printf("%d",caut());
    return 0;
}