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

int main() {
	int n; ll p;
    cin >> n >> p;
    vector<ll> a(n);
    for (int i = 0; i < n; i ++) cin >> a[i];
    int l = 0, r = 0, ans = 0; ll sum = 0;
    while (l < n) {
        if (sum != 0) sum -= a[l - 1];
        r = max(l, r);
        while (r < n && sum + a[r] <= p) {
            sum += a[r];
            r += 1;
        }
        ans = max(ans, r - l);
        l += 1;
    }
    cout << ans;
}