#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

const ll INF = 1e15;

int N, K;
ll A[100005];

ll next_offset[100005][20];
// bool used[100005];

// void clear_used(){
//     for(int i = 0; i < N; i++) used[i] = false;
// }

void build(ll m){
    ll sum_sect = 0;
    int r = -1;
    for(int i = 0; i < N; i++){
        while(sum_sect < m){
            r++;
            if(r >= 2*N) sum_sect = INF;
            sum_sect += A[r%N];
        }
        next_offset[i][0] = r-i+1;
        sum_sect -= A[i];
    }
    for(int j = 1; j < 17; j++){
        for(int i = 0; i < N; i++){
            next_offset[i][j] = next_offset[i][j-1]+next_offset[(i+next_offset[i][j-1])%N][j-1];
        }
    }
}

vector<int> bt;

ll cnt(int s){
    ll ans = 0;
    for(int i : bt){
        // used[s] = true;
        ans += next_offset[s][i];
        s += next_offset[s][i];
        s %= N;
    }
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N >> K;
    for(int i = 0; i < 17; i++){
        if(K&(1<<i)) bt.push_back(i);
    }
    for(int i = 0; i < N; i++){
        cin >> A[i];
    }
    ll l = 1, r = INF;
    
    while(r-l > 1){
        ll c = (l+r)/2;
        // clear_used();
        build(c);
        bool ok = false;
        for(int i = 0; i < N; i++){
            // if(!used[i]){
                ll tmp = cnt(i);
                if(tmp <= N) ok = true;
            // }
        }
        if(ok) l = c;
        else r = c;
    }
    cout << l << endl;
}