#include <bits/stdc++.h>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
const int NMAX=16*1e3;
int v[NMAX],n;
int k;
int main()
{
    fin>>n>>k;
    int capmin=-1;
    for(int i=1; i<=n; i++)
    {
        fin>>v[i];
        if(v[i]>capmin){
            capmin=v[i];
        }
    }
    //cout<<capmin<<endl;

    while(true)
    {
        int p=1;
        int nr=1;
        int sum=0;
        while(true){
            if(p==n+1){break;}
            sum+=v[p];
            if(sum<=capmin){
                p++;
            }
            else{
                nr++;
                sum=0;
            }
            //cout<<"nr="<<nr<<endl;

        }
        if(nr<=k){
            fout<<capmin;
            break;
        }
        else{
            capmin++;
        }
    }
    return 0;
}
//6 3 7 3 2 3 1 4