#include <bits/stdc++.h>
#define int long long
using namespace std;
void solve(){
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<int> suf(n);
    suf[n - 1] = a[n - 1];
    for (int i = n - 2; i >= 0; i--) {
        suf[i] = min(suf[i + 1], a[i + 1]);
    }
    int ans = 0;
    priority_queue<int> q;
    q.push(m);
    for (int i = 0; i < n; i++) {
        if (q.empty() || q.top() < a[i]) {
            break;
        }
        int cur = q.top();
        q.pop();
        ans++;
        cur -= a[i];
        q.push(suf[i] - 1);
        q.push(cur - suf[i] + 1);
    }
    cout << ans << endl;
}
signed main(){
    ios::sync_with_stdio(false); 
    cin.tie(0);
    int t = 1;
    while (t--) {
       solve();
    }
    return 0;
}