#include<iostream>
using namespace std;

int n,s,kk,k,i,v[16001],maxim=0;
int m(int max)
{	s=0;kk=0; 
	for(i=1;i<=n;i++)
		{
			s=s+v[i];
			if(s>max) {kk++;i--; s=0;}
		}
	kk++;
	if(kk<=k)
		{maxim=max; return 0;}
	else m(max+1);
}

int main()
{
	
FILE *f=fopen("transport.in","r"), *g=fopen("transport.out","w");
fscanf(f,"%d%d",&n,&k);

for(i=1;i<=n;i++)
	{fscanf(f,"%d",&v[i]);
	if(v[i]>maxim) maxim=v[i];}
	
m(maxim);
	
	fprintf(g,"%d\n",maxim);


fclose(f);
fclose(g);

return 0;}