#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, s=0, ck, tr, cnt;
    r>>n>>k;
    ck=k+1;
    for(int i=0; i<n; i++){
        r>>v[i];
        s+=v[i];
    }
    vmin=s/k+1;
    while(ck>k){
       ck=0;
       tr=0;
       cnt=0;
       while(cnt<=n-1){
           while(tr<=vmin){
                tr+=v[cnt];
                cnt++;
           }
           tr=0;
           ck++;
       }
       vmin++;
    }
    w<<vmin;
    return 0;
}