#include <bits/stdc++.h>

using namespace std;

int L[100005];
int dp[100005];

int main() {
    int N, M; cin >> N >> M;
    for (int i = 1; i <= N; ++i)cin >> L[i];
    

    int mt_start = 1;
    int sum_start = 1;
    long long sum = 0;
    bool dec = false;

    dp[0] = 0;

    for (int i = 1; i <= N; ++i) {
        if (i > 1) {
            if (L[i] > L[i - 1]) {
                if (dec) {
                    mt_start = i - 1;
                    dec = false;
                }
            } else if (L[i] < L[i - 1]) {
                dec = true;
            } else {
                mt_start = i;
                dec = false;
            }
        }

        sum += L[i];
        while (sum > M) {
            sum -= L[sum_start];
            sum_start++;
        }
        int j = max(mt_start, sum_start);
        dp[i] = 1 + dp[j - 1];
    }

    cout << N-dp[N];
    return 0;
}