#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr int INF = 1e9;

int main() {
  int n, w;
  cin >> n >> w;
  vector<int> a(n);
  rep(i,n) cin >> a[i];

  set<int> st;
  int cur = 0;
  int r = 0;
  int res = 0;

  for (int l = 0; l < n; l++) {

    while (r < n && !st.count(a[r]) && cur + a[r] <= w) {
      cur += a[r];
      st.insert(a[r]);
      r++;
    }

    res = max(res, r - l);
    cur -= a[l];
    st.erase(a[l]);
  }

  cout << res << endl;
  return 0;
}