#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;
ifstream r("transport.in");
ofstream w("transport.out");
int v[16001];
int main()
{
    int n, k, vmin=0, ck=0, tr=0, cnt=-1;
    r>>n>>k;
    for(int i=0; i<n; i++){
        r>>v[i];
        vmin=max(vmin,v[i]);
    }
    while(cnt<=n-1){
           while(tr+v[cnt+1]<=vmin && cnt<=n-1){
                tr+=v[cnt+1];
                cnt++;
           }
           tr=0;
           ck++;
       }
    while(ck>k){
       vmin++;
       ck=0;
       tr=0;
       cnt=-1;
       while(cnt<=n-1){
           while(tr+v[cnt+1]<=vmin && cnt<=n-1){
                tr+=v[cnt+1];
                cnt++;
           }
           tr=0;
           ck++;
       }
    }
    w<<vmin;
    return 0;
}