#include<fstream.h>
int max;
int main()
{int i,in,n,k,c,v[16001];
ifstream q("transport.in");
ofstream w("transport.out");
q>>n>>k;
int nd=k+1;
for(i=1;i<=n;i++)
	{q>>v[i];
	if(max<v[i])
	 max=v[i];}
c=max-1;
while(nd>k)
	{nd=0;
	c++;
	in=0;
	for(i=1;i<=n;i++)
		{if(in+v[i]<=c)
			in=in+v[i];
		else
		 {nd++;
		 in=0;
		 i--;}}
		nd++;}
w<<c;
return 0;}