#include <bits/stdc++.h>
using namespace std;
 
const int N = 16010;
int n, k, a[N];
 
int main(){
    ifstream cin ("transport.in");
    ofstream cout ("transport.out");
    cin >> n >> k;
    int ans = 0;
    for (int i=1; i<=n; i++) cin >> a[i], ans = max(ans, a[i]);
    auto check = [&](int cap)->bool{
        int cnt = 1, fil = 0;
        for (int i=1; i<=n; i++){
            fil += a[i];
            if (fil > cap) fil = a[i], cnt++;
        }
        return cnt <= k;
    };
    int mx = 16000 * 16000;
    for (int i=27; i>=0; i--){
        if (ans + (1 << i) <= mx && !check(ans + (1 << i)))
            ans += (1 << i);
    }
    cout << ans + 1;
    return 0;
}