#include <iostream>
#include <set>
#include <vector>

using namespace std;

int main()
{
    int N, M;
    cin >> N >> M;
    vector<int> heights(N+1);

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

    set<int> currTower;
    currTower.insert(heights[1]);
    int currHeight = heights[1];
    bool increasing = true;
    int nrTowers = 1;

    for(int i = 2; i <= N; i++){
        if(currTower.find(heights[i]) != currTower.end() || currHeight + heights[i] > M){
            nrTowers++;
            currTower.clear();
            currTower.insert(heights[i]);
            currHeight = heights[i];
            increasing = true;
        }
        else if((heights[i-1] < heights[i]) == increasing){
            currTower.insert(heights[i]);
            currHeight += heights[i];
        }
        else if(increasing){
            currTower.insert(heights[i]);
            currHeight += heights[i];
            increasing = false;
        }
        else{
            nrTowers++;
            currTower.clear();
            currTower.insert(heights[i]);
            currHeight = heights[i];
            increasing = true;
        }
    }
    cout << N - nrTowers;
    return 0;
}