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

int main() {
	int N, K, mosszeg = 0, maxh = 0, m, start = 0; cin >> N >> K;
    vector<int> napok;
    for (int j = 0; j < N; j++) {
        cin >> m;
        napok.push_back(m);
    }
    for (int i = 0; i < N; i++) {
        mosszeg+=napok[i];
        while(mosszeg>K) {
            mosszeg -= napok[start];
            start++;
        }
        maxh = max(maxh, i-start+1);
    }
    cout << maxh << endl;
}