#include <iostream>
#include <fstream>
using namespace std;

int main()
{
    ifstream f("transport.in");
    int n, i, k, v[16001];
    f>>n>>k;
    for(i=0; i<n; i++)
        f>>v[i];
    int maxim = 0;
    for(i=0; i<n; i++)
        if(v[i] > maxim)
            maxim = v[i];
    int x = 0, ok = 1, suma;
    i = 0;
    while(x != k)
    {
        i = 0;
        if(x < k && x != 0)
            maxim -= 1;
        else if(x > k && x != 0)
            maxim += 1;
        x = 0;
        while(i < n)
        {
            suma = 0;
            while(v[i] + suma <= maxim)
            {
                suma += v[i];
                i++;
            }
            x++;
        }
    }
    cout<<maxim;
    return 0;
}