#include <bits/stdc++.h>
using namespace std;

const int N=100010;
typedef long long ll;
int n;
ll m,a[100010];

int main()
{
    scanf("%d%lld",&n,&m);
    for(int i=1;i<=n;i++)
        scanf("%lld",&a[i]);
    ll sum=0;
    for(int i=1;i<=n;i++)
    {
        ll pos=(1ll*i-1ll)*(a[i]-1ll)+sum;
        //cout<<"i "<<i<<" "<<pos<<endl;
        if(m-pos<a[i])
        {
            printf("%d\n",i-1);
            return 0;
        }
        sum+=a[i];
    }
    printf("%d\n",n);
    return 0;
}