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

#define int long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second

int n, k;
vector<int> v;

set<int> s;
int max_pos;
int sum;
int cnt;

void new_segment(int i) {
    s.clear();
    sum = v[i];
    max_pos = i;
    s.insert(v[i]);
    cnt++;
}

void same_segment(int i) {
    s.insert(v[i]);
    if(v[i] > v[max_pos]) {
        max_pos = i;
    }
}

void solve() {
    cin >> n >> k;
    v.assign(1 + n, 0);
    for(int i = 1; i <= n; i++) {
        cin >> v[i];
    }
    for(int i = 1; i <= n; i++) {
        sum += v[i];
        if(s.count(i)) {
            new_segment(i);
            continue;
        }
        if(sum > k) {
            new_segment(i);
            continue;
        }
        if(v[i] > v[max_pos] && max_pos == i - 1) {
            same_segment(i);
            continue;
        }
        if(v[i] < v[i - 1]) {
            same_segment(i);
            continue;
        }
    }
    cout << n - cnt - 1 << "\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

/*
12 16
1 3 5 4 2 6 8 7 6 5 3 4
*/