#include <iostream>
#include <fstream>

using namespace std;

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

int N,K,v[16001];

int cap(int C){
    int S=0,Nr=1;
    for (int i=1; i<=N; i++){
        if (S+v[i]<=C){
            S+=v[i];
        }
        else {
            S=v[i];
            Nr++;
        }
    }
    return Nr;
}

int main()
{
    int C,maxim=0,Sum=0;
    in>>N>>K;
    for (int i=1; i<=N; i++){
        in>>v[i];
        if (v[i]>maxim) maxim=v[i];
        Sum+=v[i];
    }
    for (int i=maxim; i<=Sum; i++){
        if (cap(i)<=K){
            out<<cap(i);
            return 0;
        }
    }
}