#include <fstream>
#include <algorithm>
using namespace std;
int v[16005],c[16005];
int main()
{
    ifstream fin("transport.in");
    ofstream fout("transport.out");
    int n,k,x,k1=1,x1=0;
    fin >> n >> k;
    for(int i=1;i<=n;i++)
      {
          fin >> v[i];
          c[i]=v[i];
      }
      sort(c+1,c+n+1);
      x=c[n];
      int i=1;
      x1=0;
      while(1)
      {
      while(i<=n)
      {
          while(x1<=x)
          {
              x1+=v[i];
              i++;
          }
          x1=0;
          i--;
          k1++;
      }
      if(k1<=k)
      {
          fout << x;
          break;
      }
      else
        x++;
      k1=0;
      i=1;
      x1=0;
      }
    return 0;
}