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


int main() {
    //freopen("be2.txt", "r", stdin);

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m;
    cin >> n >> m;


    vector<int> k(n); 
    int ans = 0; 

    for(int i = 0;i < n;i++ ) {
        cin >> k[i];
    }
    long long sum = 0; 

    set<int> f;
    f.insert(k[0]); 
    sum+= k[0];
    int counter = 1; 
   

    bool increasing = true;

    for(int i = 1;i < n;i++ ) { 
        if(f.find(k[i]) != f.end() || sum + k[i] > m) {
            f.clear();
            counter++;
            f.insert(k[i]);
            sum = k[i];
            increasing = true;
        } else if(k[i] < k[i-1]) {
            if(increasing) {
                increasing = false; 
            }
            f.insert(k[i]);
            sum+= k[i];
        } else {
            if(!increasing) {
                f.clear();
                counter++;
                increasing = true;
                sum = 0;
            }
            sum += k[i];
            f.insert(k[i]);
        }
    }

    cout << n - counter << endl;
    return 0;
}