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

using namespace std;
int n,i,x,k,maxi,c;
vector<int>v;

int main()
{
    ifstream fin("transport.in");
    ofstream fout("transport.out");
    fin>>n>>k;
    for (i=0;i<n;i++)
    {
        fin>>x;
        v.push_back(x);
        maxi=max(maxi,v[i]);
    }
    c=k+1;
    while (c>k)
    {
        x=0;
        c=1;
        for (i=0;i<v.size();i++)
        {
            x=x+v[i];
            if (x>maxi)
            {
                x=v[i];
                c++;
            }
        }
        if (c>k)
        {
            maxi++;
        }
    }
    fout<<maxi;
}