#include <fstream>
#define DM 16000
using namespace std;

ifstream fi ("transport.in");
ofstream fo ("transport.out");

int s[DM], n, k, suma, mx, last;

bool functie (int i)
{
    int c = 1, total = 0;
    for (int j = 0; j < n; ++j)
    {
        if (total + s[j] > i)
        {
            ++c;
            total = 0;
        }
        total+=s[j];
    }
    if (c > k)
        return 0;
    return 1;
}

int binar (int mx, int suma, int k)
{
    int ls = 0, ld = 16000*16000, mid;
    while (ld - ls > 1)
    {
        mid = (ls + ld)/2;

        if(functie(mid))
        {
            ld = mid - 1;
            last = mid;
        }
        else
            ls = mid + 1;
    }
    fo << last;
    return last;
}

int main()
{
    fi >> n >> k;
    for (int i = 0; i <= n; ++i)
    {
        fi >> s[i];
        suma+=s[i];
        if (s[i] > mx)
            mx = s[i];
    }
    binar (mx, suma, k);
    return 0;
}