#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) (void(0))
#endif
void run_case();
int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int T = 1;
	// cin >> T;
	while (T--) run_case();
	return 0;
}
void run_case() {
	int N, W;
	cin >> N >> W;
	vector<int> A(N);
	for(auto&x: A) cin >> x;
	set<int> st;
	ll sum = 0;
	int r = 0;
	int ans = 0;
	for(int l = 0; l < N; l++) {
		while(r < N && sum + A[r] < W && st.find(A[r]) == st.end()) {
			sum += A[r];
			st.insert(A[r]);
			r++;
		}
		debug(l, r);
		ans = max(ans, r - l);
		st.erase(A[l]);
		sum -= A[l];
	}
	cout << ans << endl;
}