#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll T=1;const ll N=2e5+5;
ll n,x,y;
ll pre[N];ll a[N];ll ans=0;
void solve(){
	cin>>n>>x;
	for(ll i=1;i<=n;++i){
		cin>>a[i];pre[i]=pre[i-1]+a[i];
	}
	ll l=1;ll r=1;
	while(r<=n){
		if(pre[r]-pre[l-1]<=x){
			ans=max(ans,r-l+1);r++;
		}
		else l++;
	}cout<<ans;
	
}

int main(){
	
	while(T--)solve();
	return 0;
} 
```echarts

import sys
input = lambda:sys.stdin.readline().strip()

n,s = map(int,input().split())
a = [0] + list(map(int,input().split()))

i = j = 1
ans = 0
sum = a[i]

while(j<=n):
    if sum <= s:
        ans=max(ans,j-i+1)
        j+=1
        if j<=n:sum+=a[j]
    else:
        sum-=a[i]
        i+=1     
print(ans)