#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int a[17000],i,c,trans,n,k,t,p;
int main()
{
    freopen("transport.in","r",stdin);
    freopen("transport.out","w",stdout);
    cin>>n>>k;
    for(i=1;i<=n;i++)
    {
        cin>>a[i];
        if(a[i]>c) c=a[i];
        //b[i]=a[i];
    }
    //sort(b+1,b+n+1);
    //c=b[n];
    //p=1;
    t=1;
    for(i=1;i<=n;i++)
    {
        if(trans+a[i]>c) t++,trans=a[i];
        else trans+=a[i];
    }
    while(t>k)
        {
            t=1;
            trans=0;
            c++;
            p++;
            for(i=1;i<=n;i++)
            {
                if(trans+a[i]>c) t++,trans=a[i];
                else trans+=a[i];
            }
        }
    cout<<c;
    return 0;
}