#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int n, w;
    cin >> n >> w;
    int a[n];
    rep(i,n) cin >> a[i];
    map<int,int> mp;
    int ng[n];
    rep(i,n) ng[i] = -1;
    rep(i,n){
        if(mp.find(a[i]) != mp.end()){
            ng[i] = mp[a[i]];
        }
        mp[a[i]] = i;
    }
    int ans = 0;
    int l = 0, now = 0;

    rep(i,n){
        now += a[i];
        while(l<=ng[i]){
            now -= a[l];
            l++;
        }
        while(now>w){
            now -= a[l];
            l++;
        }
        ans = max(ans, i+1-l);
    }

    cout << ans << endl;
    return 0;
}