#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

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

int const N = 16005;
const int inf = 256000001; // cel mai mare volum posibil al unei masini

int nrTransporturi(int n, int v[], int k)
{
    int sol = 1;
    int transportCurent = 0;
    for(int i = 0; i < n; i++)
    {
        if(v[i] > k)
            return inf;

        if(transportCurent + v[i] <= k)
            transportCurent += v[i];
        else
        {
            transportCurent = v[i];
            sol++;
        }
    }
    return sol;
}

int bs(int n, int v[], int MaxTrans)
{
    int sol = 0;
    int pas = 1 << 30;
    
    while(pas > 0)
    {
        if (nrTransporturi(n, v, pas+sol) > MaxTrans)
        {
            sol += pas;
        }
        pas /= 2;
    }

    return sol + 1;
}

int main()
{
    int n, MaxTrans, v[N];
    fin >> n >> MaxTrans;

    for (int i = 0; i < n; i++)
    {
        fin >> v[i];
    }

    fout << bs(n, v, MaxTrans);
    return 0;
}