#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <string>
#include <list>
#include <cassert>
#include <numeric>
#include <cstdint>
#include <queue>
#include <deque>
#include <stack>
#include <set>
// #include <atcoder/all>
 
using ll = long long;
using ld = long double;
using namespace std;
// using namespace atcoder;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
using Priority = priority_queue<ll, vector<ll>, greater<ll>>;// 昇順
using Priority_pair = priority_queue<P, vector<P>, greater<P>>;
// using mint_17 = modint1000000007;
// using mint = modint998244353;

// typedef pair<int,int> P;
#define mod 1000000007
#define MAX_WIDTH 60
#define MAX_HEIGHT 60
#define INF 1e18
#define MOD 998244353
#define PI 3.141592653589793

ll N, M, A[200010];
int main(){
    cin >> N >> M;
    for(int i=0;i<N;i++) {
        cin >> A[i];
    }

    ll sum = 0, ave = 0, ans = INF;
    for(int i=0;i<N;i++) {
        sum += A[i];

        if(sum == 0) {
            cout << 0 << endl;
            return 0;
        }

        ave = sum / (i+1);

        if(ave == 0) {
            cout << 0 << endl;
            return 0;
        }

        ans = min(ans, ave / M);
    }
    cout << ans << endl;

    return 0;
}