#include <bits/stdc++.h>
using namespace std;

int main() {

	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n, p; cin >> n >> p;
	vector<int> a(n), prefix(n, 0);
	for (int i = 0; i < n; i++) {
        cin >> a[i];
        if (i == 0) prefix[i] = a[i];
        else prefix[i] = prefix[i - 1] + a[i];
    }

    int jj = -1, mx = 0;
    for (int i = 0; i < n; i++) {
        int j = jj, sum = 0;
        if (j != -1) sum = prefix[j] - prefix[i - 1];
        while (j + 1 < n && sum + a[j + 1] < p) {
            j++;
            sum += a[j];
        }
        jj = max(jj, j);
        mx = max(mx, j - i + 1);
    }
    cout << mx;

	return 0;
}