#include<fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int main()
{
    int n,k,v[20000],i,ok=0,maxx=0,tr,m;
    f>>n>>k;
    for(i=1;i<=n;++i)
    {
        f>>v[i];
        if(v[i]>maxx)maxx=v[i];
    }
    while(ok==0)
    {
        ok=1;
        tr=1;m=v[1];
        for(i=2;i<=n;++i)
        {
            if(v[i]+m>maxx){m=0;++tr;}
            m+=v[i];
              if(tr>k){ok=0;++maxx;break;}
        }
    }
    g<<maxx;
    return 0;
}