#include <bits/stdc++.h>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int st[100001],n,q,v[16001],cant,nt,s,ultim,k,i,maxim;
int verif(int x)
{
    k=n;
    while(k>0)
    {
        while(s<=x && k>0)
        {
            if(s+st[k]<=x)
                s+=st[k--];
            else break;
        }
        nt++;
        s=0;
    }
    return nt;
}
int transport(int cant)
{
    for(int i=cant; i>=maxim; i--)
    {
        nt=0;
        s=0;
        if(verif(i)<=q)
            ultim=i;
    }
    return ultim;
}
int main()
{
    f>>n>>q;
    for(i=1;i<=n;i++)
    {
        f>>v[i];
        cant+=v[i];
        st[++k]=v[i];
        if(v[i]>maxim) maxim=v[i];
    }
    g<<transport(cant);
    return 0;
}