#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using LL = long long;
using pii = pair<int, int>;
#define sz(x) (signed)size(x)

void solve () {
    int n;
    ll p;
    cin >> n >> p;

    vector<ll> a(n);
    for (ll& i : a)
        cin >> i;

    if (a[0] > p) {
        cout << 0 << '\n';
        return;
    }

    int ans = 0;
    __int128 sum = 0;
    for (int i = 0; i < n - 1; ++i) {
        ans = i + 1;
        sum += a[i];
        if ((__int128)(i + 2) * (a[i + 1] - 1) + sum > p)
            break;
    }



    cout << ans << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    
    solve();
}