#include <bits/stdc++.h>
#define Max 1<<28

using namespace std;

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

int n,k,i,ans,a[16001];

bool good(int x)
{
    int nr=0,t=0;
    for(int i=1;i<=n;i++)
    {
        if(a[i]>x)return false;
        if(a[i]>nr){nr=x;t++;}
        nr-=a[i];
        if(t>k)return false;
    }
    return true;
}

int main()
{
    fin>>n>>k;
    for(i=1;i<=n;i++)
        fin>>a[i];
    i=Max;
    for(;i;i>>=1)
        if(ans+i<Max&&good(ans+i)==false)
            ans+=i;
    fout<<ans+1;
    return 0;
}