#include <iostream>
using namespace std;
typedef long long ll;

int main()
{
    int n;
    ll m;
    cin >> n >> m;
    ll a[200005];
    for(int i = 0; i < n; i++) cin >> a[i];
    ll left = -1, right = 1000000002;
    while(right - left > 1){
        ll mid = (right + left) / 2;
        ll s = 0;
        bool f = true;
        for(int i = 0; i < n; i++){
            s += a[i];
            if(s < mid * m){
                f = false;
                break;
            }
            s -= mid * m;
        }
        if(f) left = mid;
        else right = mid;
    }
    cout << left << endl;
}