#include <fstream>

using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,v[16005],maxi=0,suma,s;

int main()
{
    fin>>n>>k;
    for(int i=1;i<=n;i++){
        fin>>v[i];
        if(v[i]>maxi){
            maxi=v[i];
        }
        suma+=v[i];
    }
    int st=maxi,dr=suma;
    while(st<=dr){
        int mid=(st+dr)/2;
        int sol=0,s=0,ok=0;
        for(int i=1;i<=n;i++){
            s+=v[i];
            if(s<=mid){
                continue;
            }
            else{
                sol++;
                s=0;
            }
        }
        if(sol<k)
            dr=mid-1;
        else
            st=mid+1;
    }
    fout<<st+1;
    return 0;
}