#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, p;
    cin >> n >> p;

    vector<int> alap(n);
    for(int &x : alap){
        cin >> x;
    }

    vector<int> pref(n + 1);
    for(int i = 1; i <= n; i++){
        pref[i] = pref[i - 1] + alap[i - 1];
    }

    int ans = 0;

    for(int i = 0; i < n; i++){
        int l = i, r = n - 1;
        int ind = -1;

        while(l <= r){
            int k = (l + r) / 2;

            int ert = pref[k + 1] - pref[i];

            if(p >= ert){
                ind = k;
                l = k + 1;
            } else{
                r = k - 1;
            }
        }

        if(ind == -1) continue;

        ans = max(ans, ind - i + 1);
    }

    cout << ans << "\n";
}