#include <fstream>

using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, i, v[16000], t, l, maxi, k, a;
int main()
{
    fin >> n >> t;
    for (i=0; i<n; i++)
    {
        fin >> v[i];
        if (maxi<v[i]) {maxi=v[i];}
    }
    k=maxi-1;
    while (l!=t)
    {
        k++;
        l=0;
        a=0;
        for (i=0; i<n; i++)
        {
            if (a+v[i] > k) {a=0; l++;}
            a=a+v[i];
        }
        l++;
    }
    fout << k;
    return 0;
}