#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int N, M;
    cin >> N >> M;

    vector<int> L(N + 1);
    for (int i = 1; i <= N; ++i) {
        cin >> L[i];
    }

    vector<int> dp(N + 1, 0);
    vector<int> start(N + 1);
    
    int inc_start = 1;
    long long sum = 0;
    int sum_start = 1;

    for (int i = 1; i <= N; ++i) {
        if (i == 1) {
            start[i] = 1;
            inc_start = 1;
        } else {
            if (L[i] > L[i - 1]) {
                inc_start = (L[i] == L[i-1]) ? i : inc_start; 
                start[i] = inc_start;
            } else if (L[i] < L[i - 1]) {
                start[i] = start[i - 1];
                inc_start = i; 
            } else {
                start[i] = i;
                inc_start = i;
            }
        }

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

    cout << N - dp[N] << "\n";

    return 0;
}