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

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}

ll nextLong() { ll x; scanf("%lld", &x); return x;}

int main2() {
  int N = nextLong();
  ll W = nextLong();
  vector<ll> a(N);
  REP(i, N) a[i] = nextLong();

  int ans = 0;
  int l = 0, r = 0;
  ll s = 0;
  map<ll, int> count;
  int ng = -1;
  while (l < N) {
    bool ok = (s <= W) && ng == -1;

    if (ok) {
      chmax(ans, r - l);
    }

    if (r == N || !ok) {
      if (count[a[l]] == 2) ng = -1;
      count[a[l]]--;
      s -= a[l];
      l++;
    } else {
      count[a[r]]++;
      if (count[a[r]] == 2) ng = a[r];
      s += a[r];
      r++;
    }
  }

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

int main() {

#ifdef LOCAL
  for (;!cin.eof();cin>>ws)
#endif
    main2();
  return 0;
}