#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
	int N; ll M; cin >> N >> M;
	vector<int>V(N);
	for(auto& i : V) cin >> i;
	int l = 0, r = N; 
	while(l < r){
		int m = l + (r - l) / 2;
		ll maxs = 0;
		bool v = true;
		for(int i = 0; i < m - 1; i++) maxs += V[i];
		for(int i = m - 1; i < N; i++){
			maxs += V[i];
			if(maxs > M){
				v = false;
				break;
			}
			maxs -= V[i - m + 1];
		}
		if(v){
			l = m + 1;
		}
		else{
			r = m;
		}
	}
	cout << max(0, l - 1);
}