#include <cstdlib>
#include <iostream>
#include <stdio.h>

using namespace std;

int n,k,i,j,v[16001],m,s,d,mij,ok,r;

int verif()
{
    int x,l,i,kk;
    
    kk=0;
    x=mij;i=0;
    
    while (i<=n)
    {
    l=0;kk++;
    while ((l+v[i]<=x)&&(i<n))
    {
          i++;
          l+=v[i];       
    }  
    
    } 
    
    if ((kk<=n)&&(kk<min))
    {
       min=kk;
    }
    else if (kk<=n)
    {
        d=mij-1;
    }
    
    if(kk>n)
    s=mij+1;
    
    
}


int main()
{
    freopen("transport.in","r",stdin);
    freopen("transport.out","w",stdout);
    
    scanf("%d%d\n",&n,&k);
    min=k+10;
    
    for (i=1;i<=n;i++) scanf("%d",v[i]);
    s=1;d=n;
    
    while (ok==0)
    {
          
          mij=(s+d)/2;
          
          verif();
               
          if (d-s<1)    ok=1;
          
          
    }
    
    printf("%d",min);
    return 0;
}