#include <fstream>

using namespace std;

ifstream fin("transport.in");
ofstream fout("transport.out");

int n,k,maxim;
int v[16005];

bool gasit(int maxim)
{
    int s=0,nr=0;
    for (int i=0;i<n;i++) {
        if (s+v[i]<=maxim) s+=v[i];
        else {
            s=v[i];
            nr++;
        }
    }
    if (nr<k) return true;
    return false;
}

int main()
{
    fin>>n>>k>>maxim;v[0]=maxim;
    for (int i=1;i<n;i++) {
        fin>>v[i];
        if (v[i]>maxim) maxim=v[i];
    }
    while (!gasit(maxim)) maxim++;
    fout<<maxim;
}