#include <iostream>
#include <vector>

using namespace std;

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

    vector<int> a(n);
    for(int &x : a) cin >> x;

    int pref = 0;
    int l = 0;
    int najduze = 0;

    for(int d = 0; d < n; d++) {
        pref += a[d];

        while(pref > m) {
            pref -= a[l];
            l++;
        }

        int novo = d - l + 1;
        if(novo > najduze) najduze = novo;
    }

    cout << najduze << endl;
}