#include <iostream>
#include <fstream>
using namespace std;
int v[100001];
int main () {
    ifstream f("transport.in");
    ofstream g("transport.out");
    int n,p,i;
    f>>n>>p;
    int nr=p+1,s=0,k,maxim=0;
    for(i=0;i<n;i++) {f>>v[i]; if(v[i]>maxim) maxim=v[i];}
    for(k=maxim;nr>p;k++)
    { nr=0;
    for(i=0;i<n;i++){
        while((s+v[i])<=k&&i<n){s+=v[i];i++;}
    s=0;nr++;i--;}}
    g<<k-1;
    }