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

#define int long long

int n, k, mx, sum, cnt;
vector<int> v;
set<int> s;

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

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

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> k;
    v.resize(n+1);
    for(int i = 1; i <= n; i++)cin >> v[i];
    new_seg(1);
    for(int i = 2; i <= n; i++) {
        sum += v[i];
        if(sum > k) 
        {
            new_seg(i);
            continue;
        }
        if(s.count(v[i]))
        {
            new_seg(i);
            continue;
        }
        if(v[i] > v[mx] && mx == i - 1)
        {
            old(i);
            continue;
        }
        if(v[i] < v[i - 1])
        {
            old(i);
            continue;
        }
        new_seg(i);
    }
    cout << n - cnt;
    return 0;
}