#include <bits/stdc++.h>

#define speed cin.tie(0); ios::sync_with_stdio(0)
#define cinv(v) for (auto& e : v) cin >> e;
#define all(v) v.begin(), v.end()
#define has(s, e) s.count(e)

using namespace std;
using ll = long long;
using point = array<int, 2>;

int main() {
    speed;

    int N, P;
    cin >> N >> P;
    vector<int> v(N);
    cinv(v);

    int result = 0, curr_sum = v[0]; 

    for (int l = 0, r = 1; r <= N; r++) {

        while (P < curr_sum && l < r - 1) {
            curr_sum -= v[l];
            l++;
        }

        if (curr_sum <= P) {
            result = max(result, r - l);
        }

        if (r < N) {
            curr_sum += v[r];
        }
    }

    cout << result;
}