#include <iostream>
#include<bits/stdc++.h>
using namespace std;
bool check(vector<int> &arr,int mid,int m){
int n = arr.size();
vector<int> temp(n+1,0);
for(int i=1;i<=n;i++){
int a = i*mid + arr[i];
temp[i]=a;
}
sort(temp.begin()+1,temp.end());
int sum=0;
for(int i=1;i<=mid;i++){
sum+=temp[i];
}
return sum<=m;
}
int main() {
// your code goes here
int n,m;
cin>>n>>m;
vector<int> arr(n+1,0);
int low=0;
int high=n;
for(int i=1;i<=n;i++){
cin>>arr[i];
}
int ans=0;
while(low<=high){
int mid=(low+high)/2;
if(check(arr,mid,m)==true){
ans=mid;
low=mid+1;
}
else{
high=mid-1;
}
}
cout<<ans<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCgpib29sIGNoZWNrKHZlY3RvcjxpbnQ+ICZhcnIsaW50IG1pZCxpbnQgbSl7CgkKCWludCBuID0gYXJyLnNpemUoKTsKCXZlY3RvcjxpbnQ+IHRlbXAobisxLDApOwoJCglmb3IoaW50IGk9MTtpPD1uO2krKyl7CgkJaW50IGEgPSBpKm1pZCArIGFycltpXTsKCQl0ZW1wW2ldPWE7Cgl9CgkKCXNvcnQodGVtcC5iZWdpbigpKzEsdGVtcC5lbmQoKSk7CglpbnQgc3VtPTA7CgkKCWZvcihpbnQgaT0xO2k8PW1pZDtpKyspewoJCXN1bSs9dGVtcFtpXTsKCQkKCX0KCQoJcmV0dXJuIHN1bTw9bTsKCQp9CmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IG4sbTsKCWNpbj4+bj4+bTsKCXZlY3RvcjxpbnQ+IGFycihuKzEsMCk7CglpbnQgbG93PTA7CglpbnQgaGlnaD1uOwoJCglmb3IoaW50IGk9MTtpPD1uO2krKyl7CgkJY2luPj5hcnJbaV07Cgl9CglpbnQgYW5zPTA7CgkKCXdoaWxlKGxvdzw9aGlnaCl7CgkJaW50IG1pZD0obG93K2hpZ2gpLzI7CgkJCgkJaWYoY2hlY2soYXJyLG1pZCxtKT09dHJ1ZSl7CgkJCWFucz1taWQ7CgkJCWxvdz1taWQrMTsKCQkJCgkJfQoJCWVsc2V7CgkJCWhpZ2g9bWlkLTE7CgkJCQoJCX0KCX0KCQoJY291dDw8YW5zPDxlbmRsOwoJCgkKCXJldHVybiAwOwp9