#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 1e5 + 10;
const ll INF = 2e18;

int n;
ll p, a[N], mmin[N];
__int128 tp;

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n >> p;
    for (int i = 1; i <= n; i++) cin >> a[i];
    mmin[n + 1] = INF;
    for (int i = n; i >= 1; i--) mmin[i] = min(mmin[i + 1], a[i]);

    for (int i = 1; i <= n; i++) {
        if (tp + mmin[i + 1] > p) {
            cout << i - 1; return 0;
        }
        tp += mmin[i + 1] + a[i] - 1;
    }
    cout << n;
    return 0;
}