#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
int v[16000],i,n,k,s=0,vmax,maxi,nr,s2;
int main()
{
     ifstream f("transport.in");
     ofstream g("transport.out");
     f>>n>>k;
     for (i=1;i<=n;i++){
     f>>v[i]; s=s+v[i];
     }
     vmax=s/k+1;maxi=0;
     for (i=1;i<=n;i++){
     if (v[i]>maxi) maxi=v[i];
     else maxi=maxi;
     }
     do{
     i=0;nr=0;
     while (i<=n){
     s=0;
     while ((s<=maxi)&&(i<=n)) {i++;s=s+v[i];}
     if (s>maxi) i--;
     nr++;
     if (nr>k) maxi++;}
     }while (nr<=k);
    g<<maxi;
    f.close ();
    g.close ();
    return 0;
}