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

int main() {
    int n, k;
    cin >> n >> k;
    vector<int> v(n);
    for(int i = 0; i < n; ++i) cin >> v[i];
    /*int l = 0;
    int r = 0;
    long long sum = v[0];
    int maxi = 0, lans = -1, rans = -1;
    while(l < n) {
        if(r < n - 1) {
            if(v[r+1] > k) {
                l = r + 2;
                r = r + 2;
                if(r < n) {
                    sum = v[r];
                } else break;
            }
        }
        while(r < n - 1 && sum + v[r+1] <= k) {
            ++r;
            sum += v[r];
        }
        //if(r-l+1>maxi){lans=l;rans=r;}
        maxi = max(r - l + 1, maxi);
        ++l;
        sum -= v[l-1];
    }
    //cout << lans+1 << " " << rans+1 << "\n";
    cout << maxi << "\n";*/
    int maxi = 0;
    for(int i = 0; i < n - 1; ++i) {
        long long sum = v[i];
        for(int j = i+1; j < n; ++j) {
            sum += v[j];
            if(sum <= k) maxi = max(maxi, j - i + 1);
        }
    }
    cout << maxi << "\n";
    return 0;
}