#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long a[100010];
int main() {
	long long n, k;
	cin >> n >> k;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	long long ans = 0;
	int right = 0;
	long long sum = 0;
	set<long long>st;
	int s = 0;
	for (int left = 0; left < n; left++) {
		while (right < n && sum + a[right] <= k) {
			if (!st.empty()) {
				s = st.size();
			}
			st.insert(a[right]);
			if (s == st.size()) {
				break;
			}
			sum += a[right];
			right++;
		}
		if (ans < right - left) {
			ans = right - left;
		}
		if (left == right) {
			right++;
			st.insert(a[right]);
		}
		else {
			st.erase(a[left]);
			sum -= a[left];
		}
	}
	cout << ans << endl;
}