#include <algorithm>
#include <vector>

using namespace std;

int quadri(int N, long long M, int V[]) {
  int start = 0;
  int c = 0;
  long long sum = 0;
  vector<int> out;
  for (int i = 0; i < N && start < N; i++) {
    sum += V[i];
    c++;
    bool enter = false;
    while (sum > M && start < N) {
      sum -= V[start];
      start++;
      c--;
      enter = true;
    }
    if (enter) {
      out.push_back(c);
    }
  }
  if (out.size() == 0) {
    return N;
  }
  sort(out.begin(), out.end());
  if (out.front() < 0) {
    return 0;
  }
  return out.front();
}