#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 998244353, N = 100005;

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int n;
    ll p, c[N];
    cin >> n >> p;
    for (int i = 0; i < n; ++i)
        cin >> c[i];
    for (int i = 0; i < n; ++i) {
        ll tmp = p / (i + 1);
        if (tmp >= c[i] || (tmp == c[i] - 1 && p % (i + 1) != 0))
            p -= c[i];
        else
            return cout << i << '\n', 0;
    }
    cout << n << '\n';
}