#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll ceil(ll a, ll b) { return (a + b - 1) / b; }

int main() {
  ll n, k;
  cin >> n >> k;
  vector<ll> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];

  auto f = [&](ll x) {
    ll s = 0, op_sum = 0;
    for (int i = 0; i < n; i++) {
      ll ai = a[i] + s;
      if (ai >= x) continue;
      ll op = ceil(x - ai, i + 1);
      op_sum += op;
      s += op * (i + 1);
    }
    return op_sum <= k;
  };

  ll lo = -1, hi = 1e15;
  while (hi - lo > 1) {
    ll mi = (lo + hi) / 2;
    if (f(mi))
      lo = mi;
    else
      hi = mi;
  }
  cout << lo << "\n";
}