#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int N, K, a[16005];
int Div(int x) {
    int secv = 1, i, ct = 0;
    for (i = 1; i <= N; i++){
         if (a[i]>L) return 0;
         ct+= a[i]
         if (ct > x) {
            secv++;
             ct = a[i];
         }
    }
    if( secv <= K) return 1;
    return 0;
}
int Cautare_binara(int st, int dr) {
     int mid = (st + dr) / 2;
     if (st == dr) return mid;
     if (Div(mid) == 0)return CautBin(mid+1, dr);
     else return CautBin(st, mid);
}

int main() {
    int x;
    ifstream f("transport.in");
    ofstream g("transport.out");
    f >> N >> K;
    for (i = 1; i <= N; i++) {
        f >> a[i];
    }
    x == Cautare_binara();
    g << x;
}