#include <iostream>
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
short n,k,v[16001];
int suma = 0;
int raspuns;
int cautare(int inceput, int sfarsit) {
    int mijl = (inceput + sfarsit) / 2;
    if(mijl == inceput || sfarsit <= inceput) {
      return 0;
    }
    int contor = 0;
    int i = 0,s=0;
    while(i < n) {
        s = 0;
        while(s <= mijl) {
          s += v[i];
          i++;
        }
        s -= v[i-1];
        i--;
        contor++;
    }
    if(contor == k) {
      raspuns = mijl;
//      cautare(inceput,sfarsit-2);
    }
    else if(contor > k) {
        cautare(mijl,sfarsit);
    }
    else {
        cautare(inceput,mijl);
    }
}

int main() {
  f >> n >> k;
  int max = 0;
  for(int i = 0; i < n; i++) {
      f >> v[i];
      if(max < v[i]) {
        max = v[i];
      }
      suma += v[i];
  }
  cautare(max,suma);
  g << raspuns;
}