#include <bits/stdc++.h>
#include <climits>
using namespace std;
using ll = long long;
int quadri(int N, long long M, int V[]) {
  // Scrivete qui la vostra soluzione
  int B = INT_MAX;
  int l = 0;
  int r = 0;

  ll sum = 0;
  while (r < N) {
    // allargo finche posso
    while (r < N and sum + (ll)V[r] <= M) {
      sum += V[r];
      r++;
    }
    B = min(B, r - l);
    sum -= V[l];
    l++;
  }

  return B;
}