#include <algorithm>
#include <vector>

using namespace std;

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