#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000010, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
int n, m, w[N];

void solve() {
    scanf("%d%d", &n, &m);
    priority_queue<pair<ll, ll>, vector<pair<ll, ll> >, greater<pair<ll, ll> > > q;
    for (int i = 1; i < m + 1; i++) q.push({0, i});
    for (int i = 1; i < n + 1; i++) { 
        scanf("%d", w + i);
        auto u = q.top(); q.pop();
        u.first += w[i];
        q.push(u);
    }
    while (q.size() > 1) q.pop();
    printf("%lld\n", q.top().first);
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
    return 0;
}