#include <bits/stdc++.h>
using namespace std;
struct iv{int kezd,veg;};
int main()
{
    //ifstream f("szamok.txt");
    int n,m,x; cin>>n>>m;
    vector<int>a(n);
    for(int i=0; i<n; i++){cin>>a[i];}
    vector<iv>vallum; int k=0;
    while(k<n){
        bool ciklus=1; int mag=a[k];
        iv lok; lok.kezd=k;
        if(a[k]<a[k+1]){
            while(a[k]<a[k+1]&& mag+a[k+1]<=m){k++; mag+=a[k];}
            while(a[k]>a[k+1]&& mag+a[k+1]<=m){k++; mag+=a[k];}}
        else if(a[k]>a[k+1]){
            while(a[k]>a[k+1]&& mag+a[k+1]<=m){k++; mag+=a[k];}}
        if(k==n)k--; lok.veg=k;
        vallum.push_back(lok); k++;}
    /*for(int p=0; p<vallum.size(); p++){
        cout<<vallum[p].kezd<<" "<<vallum[p].veg<<endl;}*/
    int s=0;
    for(int p=0; p<vallum.size(); p++){
        bool van=0;
        for(int i=vallum[p].kezd; i<=vallum[p].veg; i++){
            for(int j=i+1; j<=vallum[p].veg; j++){if(a[i]==a[j]){van=1; break;}}}
        if(van && vallum[p].kezd!=vallum[p].veg)s+=2;
        else s+=1;}
    cout<<n-s;
    return 0;
}