111111
 100009
 10011
 1000000
 8
 10201
 102030
 908172
 123456
 415
 900000
 21
 909090
 314159
 999999
 909823
 987654
 1453
 1435
 98
 10
 2
 1

1
111111
 9
100001 1 1 1 1 1 1 1 1
 1
10011
 1
1000000
 8
1 1 1 1 1 1 1 1
 2
10101 100
 3
101010 1010 10
 9
101111 101011 101010 101010 101010 101010 101010 101000 100000
 6
111111 11111 1111 111 11 1
 5
111 101 101 101 1
 9
100000 100000 100000 100000 100000 100000 100000 100000 100000
 2
11 10
 9
101010 101010 101010 101010 101010 101010 101010 101010 101010
 9
111111 101011 101011 1011 11 1 1 1 1
 9
111111 111111 111111 111111 111111 111111 111111 111111 111111
 9
101111 101111 101101 101100 101100 101100 101100 101100 101000
 9
111111 111111 111111 111111 111110 111100 111000 110000 100000
 5
1111 111 111 110 10
 5
1111 111 111 101 1
 9
11 11 11 11 11 11 11 11 10
 1
10
 2
1 1
 1
1

#include <bits/stdc++.h>
using namespace std;
long long int a[100001] = {0};
long long int bsrch(long long int l, long long int r, long long int el) {
  long long int mid = 0, f = 0;
  while (l <= r) {
    mid = (l + r) / 2;
    if (a[mid] == el) {
      f = 1;
      break;
    } else if (a[mid] < el)
      l = mid + 1;
    else
      r = mid - 1;
  }
  if (f == 1 || a[mid] < el)
    return mid;
  else
    return mid - 1;
}
int main() {
  long long int n, el, t;
  cin >> n >> t;
  long long int mx = -1;
  for (long long int i = 0; i < n; i++) {
    cin >> el;
    if (i == 0)
      a[i] = el;
    else
      a[i] = el + a[i - 1];
  }
  for (long long int i = 0; i < n; i++) {
    long long int l = i;
    long long int r = n - 1;
    if (i == 0)
      el = t;
    else
      el = t + a[i - 1];
    if (mx < (r - l + 1)) {
      long long int tot = bsrch(l, r, el);
      mx = max(tot - i + 1, mx);
    } else
      break;
  }
  cout << mx << endl;
}
