#include <iostream>
#include <fstream>

using namespace std;

ifstream f ("transport.in");
ofstream g ("transport.out");

int n, k, i, m, s, v[1001], x, aux, j, ok=1;

int
main ()
{
  f >> n >> k;
  for (i = 1; i <= n; i++)
    {
      f >> v[i];
      if (v[i] > m)
	m = v[i];
    }
  aux = 1;
  while (ok)
    { 
      for (i = 1; i <= n; i++)
	{
	    if(s+v[i]<=m)
		{
		  s = s + v[i];
		}
	      else
	      {
	       s=v[i];
	      aux++;
	      }
	}
	    
      if (aux > k)
	{
	  aux = 0;
	  m++;
	  x = n;    

	}
	else 
	ok=0;
}
    g<<m;



  return 0;
}