#include<bits/stdc++.h>

using namespace std;

const int N=5e6+5;

#define int long long

int c;
int w[N];
int s[N];

bool ok(int t){
    if(!t) return true;

    __int128 fir=__int128(t-1)*(w[t]-1);
    if(fir>1e18) return false;
    int sec=fir+s[t-1];
    if(sec>1e18) return false;
    return c-sec>=w[t];
}

signed main(){
    int n; cin>>n>>c;
    for(int i=1; i<=n; i++) scanf("%d", w+i), s[i]=min((int)2e18, s[i-1]+w[i]);

    int l=0, r=n;
    while(l<r){
        int mid=l+r+1>>1;
        if(ok(mid)) l=mid;
        else r=mid-1;
    }
    cout<<l<<endl;

    return 0;
}