#include<stdio.h>
#include<algorithm>
#define maxn 16005
using namespace std;

int n,m,s,start,sol;
int a[maxn];

void read()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
     scanf("%d",&a[i]),start=max(start,a[i]),s+=a[i];
}

int check(int k)
{
    int i,sum=0,nr=0;
    for(i=1;i<=n && nr<m;sum=0,nr++)
      for(;sum+a[i]<=k && i<=n;sum+=a[i++]);
    if(i<=n) return 0;
    return 1;
}

void solve()
{
    int i,step;

    for(step=1;step<s;step<<=1);
    for(i=start-1;step;step>>=1)
      if(i+step<=s)
      {
          if(check(i+step)) sol=i+step;
          else i+=step;
      }
}

int main()
{
    freopen("transport.in","r",stdin);
    freopen("transport.out","w",stdout);

    read();
    solve();
    printf("%d",sol);

    fclose(stdin);
    fclose(stdout);
    return 0;
}