#include <bits/stdc++.h>
using namespace std;
#define InTheNameOfGod ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
using ll = long long;

const int maxN = 2e5 + 5;
const int MOD = 1e9 + 7;

set<int> cur;
int n,m, sum;

bool tryAdd(int x) {
    return (cur.find(x) == cur.end() && sum + x <= m);
}


int main() {
   InTheNameOfGod;
    
    cin >> n >> m;
    vector<int> v(n);
    for(int &i : v) cin >> i;

    int cnt = 0;
    bool csucs = true;
    cur.insert(v[0]);
    sum = v[0];

    for(int i = 1; i < n; i++) {
        if(csucs && v[i] <= v[i-1]) csucs = false;
        if((!csucs && v[i] >= v[i-1]) || !tryAdd(v[i])) {
            cnt++;
            csucs = 1;
            sum = v[i];

            cur.clear();
            cur.insert(v[i]);
            continue;
        }

        sum += v[i];
        cur.insert(v[i]);
    }

    cout << n-cnt-1;

    return 0;
}