#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <math.h>
#include <array>

using namespace std;
using ll = long long;

signed main()
{
	iostream::sync_with_stdio(0);
	cin.tie(0);

	int n, p;
	cin >> n >> p;
	vector<int> costs(n);
	for (int i = 0; i < n; i++) cin >> costs[i];

	int l = 0, r = 0, sum = costs[0], best = 0;
	while (true) {
		if (p < sum) sum -= costs[l++];
		else {
			best = max(best, r - l + 1);
			if (r == n - 1) break;
			sum += costs[++r];
		}
	}
	cout << best;
}