#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");

int main()
{
    int n,k;
    vector<int> v;

    f>>n>>k;
    for(int i=0;i<n;i++){
        int x;
        f>>x;
        v.push_back(x);
    }

    int c = *max_element(v.begin(),v.end());

    while(true){
        int nr=1,cn=0,i;
        for(i=0;i<n&&nr<=k;++i){
            if(cn+v[i]<=c)
                cn+=v[i];
            else{
                nr++;
                cn=v[i];
            }
        }
        if(i==n&&nr==k)
            break;
        else
            c++;
    }
    g<<c;

    return 0;
}