#include <iostream>
#include <stdio.h>

using namespace std;

int n,v[16001];

int drumuri(int x){
    int i,drum,s;
    i=1;
    drum=0;
    while(i<=n){
        s=0;
        while(i<=n&&s+v[i]<=x){
            s+=v[i];
            i++;
        }
        drum++;
    }
    return drum;
}


int main(){

    freopen("transport.in","r",stdin);
    freopen("transport.out","w",stdout);

    int k,pas,i,putere,maxim;

    scanf("%d%d",&n,&k);
    maxim=0;
    for(i=1;i<=n;i++){
        scanf("%d",&v[i]);
        if(v[i]>maxim)
            maxim=v[i];
    }

    putere=1<<18;
    pas=0;
    while(putere>0){
        if(pas+putere<maxim||drumuri(pas+putere)>k)
            pas+=putere;
        putere/=2;
    }

    printf("%d",pas+1);

    return 0;
}