#include<iostream>
#include<fstream>
#include<math.h>
#include<algorithm>

using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
long long maxi,n,m,j,i,t,s,st,v[16002],dr,ok,sol;
int main(){
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
        if(v[i]>maxi)
            maxi=v[i];
    }
    st=1;
    dr=16003*16003;
    if(n!=m)
    while(st<=dr) {
        t=(st+dr)/2;
        if(t>=maxi)
        {
            ok=0;
            s=0;
            for(i=1;i<=n;i++)
                if(s+v[i]<=t)
                {
                    s=s+v[i];
                }
                else
                {
                    ok++;
                    s=v[i];
                }
            ok++;
            if(ok>m)
            {
                st=t+1;
                sol=st;
            }
            else
                dr=t-1;
        }
        else
            st=t+1;
    }
    else
        sol=maxi;
    if(sol!=0)
        fout<<sol;
    else
        fout<<st;
    fin.close();
    fout.close();
    return 0;
}