#include <iostream>
#include <vector>

using namespace std;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, p;
    cin >> n >> p;

    vector<int> napok(n);
    for (int i = 0; i < n; i++) {
        cin >> napok[i];
    }

    int bal = 0, current_sum = 0, max_length = 0;

    for (int jobb = 0; jobb < n; jobb++) {
        current_sum += napok[jobb];

        while (current_sum > p) {  // Ha túllépjük P-t, csökkentjük az ablakot
            current_sum -= napok[bal];
            bal++;
        }

        max_length = max(max_length, jobb - bal + 1);
    }

    cout << max_length << "\n";

    return 0;
}