#include <fstream>

using namespace std;
int n, k;
int a[16001];
int NrTrans(int C)
{
    int i, nrt, c;
    nrt = 0;
    c = C;
    for(i = 1; i <= n; i++)
    {
        c = C;
        while(a[i] <= c)
        {
            c -= a[i];
            i++;
        }
        nrt++;
        i--;
    }
    return nrt;
}
ifstream fin("transport.in");
ofstream fout("transport.out");
int main()
{
    int maxim, suma, i;
    fin >> n >> k;
    maxim = -1;
    suma = 0;
    for(i = 1 ; i <= n; i++)
    {
        fin >> a[i];
        if(a[i] > maxim)
            maxim = a[i];
        suma += a[i];
    }
    for(i = maxim; i <= suma; i++)
        if(NrTrans(i) <= k)
        {
            fout << i;
            return 0;
        }
    fin.close();
    fout.close();
    return 0;
}