#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n, w;
    cin >> n >> w;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];
    ll cv = a[0];
    set<ll> s;
    ll l = 0, ans = (a[0] > w) ? 0 : 1;
    s.insert(a[0]);
    reps(r, 1, n) {
        bool dup = s.count(a[r]) > 0;
        cv += a[r];
        while(((dup) || (cv > w)) && (l <= r)) {
            if ((dup) && (a[l] == a[r])) {
                dup = false;
            }
            cv -= a[l];
            s.erase(a[l]);
            l++;
        }
        s.insert(a[r]);
        ans = max(ans, r - l + 1);
    }
    cout << ans << endl;
    return 0;
}