#include <iostream>
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int n,k,v[16005],cnt;
int verif(int x)
{
    int s=1;
    for(int i=1;i<=k;i++)
    {
        int c=x;
        while(c-v[s]>=0)
        {
            c=c-v[s];
            s++;
            if(s==n+1)
                return 1;
        }
    }
    return 0;
}
int main()
{
    in>>n>>k;
    for(int i=1;i<=n;i++)
        in>>v[i];
    int st=1;
    int dr=16005*16005;
    while(st<=dr)
    {
        int mid=(st+dr)/2;
        if(verif(mid)==0)
            st=mid+1;
        else
        {
            dr=mid-1;
            cnt=mid;
        }
    }
    out<<cnt;
    return 0;
}