#include <fstream>
using namespace std;
int n,k,v[16000],st,dr,l,drum,s;
void bin(int cs,int cd);
ifstream fin ("transport.in");
ofstream fout("transport.out");
int main ()
{
    fin>>n>>k;
    for(int i=0; i<n; ++i)
    {
        fin>>v[i];
        dr+=v[i];
        st=max(v[i],st);
    }
    bin(st,dr);
}
void bin(int cs, int cd)
{
    s=v[0];
    drum=1;
    l=(cs+cd)/2;
    for(int i=1; i<n; ++i)
    {
        if(v[i]+s<=l)s+=v[i];
        else
        {
            drum++;
            s=v[i];
            if(drum>k)
            {
                if(cs+1==cd)
                {
                    fout<<cs+1<<" ";
                    return;
                }
                bin((cs+cd)/2,cd);
            }
        }
    }
    if(cs+1==cd)
   {
        fout<<cs-1;
        return;
    }
    bin(cs,(cd+cs)/2);
}