#include <bits/stdc++.h>
using namespace std;

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

int n, k, a[16003], nr, s, x;

int main()
{
    int i, j;
    fin >> n >> k;
    for (i = 1; i <= n; i++)
    {
        fin >> a[i];
        nr = max(nr, a[i]);
    }
    for (i = nr; i <= 16000; i++)
    {
        s = 0; x = 0;
        for (j = 1; j <= n; j++)
            if (a[j] + s <= i) s += a[j];
            else
            {
                x++;
                s = a[j];
            }
        if (s != 0) x++;
        if (x <= k)
        {
            fout << i << "\n";
            fout.close();
            return 0;
        }
    }
    return 0;
}