#include <iostream> 
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

const int N = 16005;

int n, z;
int v[N];

bool sePoate(int x)
{
    int nrZile = 1;
    int capFolosita = 0;
    for(int i = 0; i < n; i++)
    {
        if(v[i] > x)
            return false;
        
        if(capFolosita + v[i] > x)
        {
            nrZile++;
            capFolosita = v[i];
        }
        else
            capFolosita += v[i];

        if(nrZile > z)
            return false;
    }
    return true;
}

int cautBinar()
{
    int st = 1;
    int dr = 256000000;
    int r = 0;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        if(sePoate(mij))
        {
            r = mij;
            dr = mij - 1;
        }
        else
            st = mij + 1;
    }
    return r;
}

int main()
{
    fin >> n >> z;
    for(int i = 0; i < n; i++)
        fin >> v[i];

    fout << cautBinar() << '\n';

    fin.close();
    fout.close();
    return 0;
}