#include <iostream>
#include <algorithm>
#include <vector>
 
using namespace std;
 
int main() {
	int n,t,ans=0,sum1=0;
	cin>>n>>t;
	vector <int> v;
	vector <int> sum;
	for(int i=0;i<n;i++){
		int x;
		cin>>x;
		sum1+=x;
		v.push_back(x);
		sum.push_back(sum1);
	}
	int low=0,high=n-1;
	while(high>=low){
		bool f=0;
		int mid=(high+low)/2;
		for(int i=0;i<n;i++){
			if(sum[i+mid-1]-sum[i]<=t){
				low=mid+1;
				ans=mid;
				f=1;
				break;
			}
		}
		if(!f){
			high=mid-1;
		}
	}
	cout<<ans;
 
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8dmVjdG9yPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJaW50IG4sdCxhbnM9MCxzdW0xPTA7CgljaW4+Pm4+PnQ7Cgl2ZWN0b3IgPGludD4gdjsKCXZlY3RvciA8aW50PiBzdW07Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQlpbnQgeDsKCQljaW4+Png7CgkJc3VtMSs9eDsKCQl2LnB1c2hfYmFjayh4KTsKCQlzdW0ucHVzaF9iYWNrKHN1bTEpOwoJfQoJaW50IGxvdz0wLGhpZ2g9bi0xOwoJd2hpbGUoaGlnaD49bG93KXsKCQlib29sIGY9MDsKCQlpbnQgbWlkPShoaWdoK2xvdykvMjsKCQlmb3IoaW50IGk9MDtpPG47aSsrKXsKCQkJaWYoc3VtW2krbWlkLTFdLXN1bVtpXTw9dCl7CgkJCQlsb3c9bWlkKzE7CgkJCQlhbnM9bWlkOwoJCQkJZj0xOwoJCQkJYnJlYWs7CgkJCX0KCQl9CgkJaWYoIWYpewoJCQloaWdoPW1pZC0xOwoJCX0KCX0KCWNvdXQ8PGFuczsKCQoJcmV0dXJuIDA7Cn0=

MyAzCjIgMiAz

3 3
2 2 3