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

int main() {
	int n, m;
	cin >> n >> m;
	vector<int> v(n);
	for (int i = 0; i < n; ++i) {
		cin >> v[i];
	}

	int stacks = 1;
	int sum = v[0];
	unordered_set<int> s = {v[0]};
	bool up = true;

	for (int i = 1; i < n; ++i) {
		if (v[i] > v[i - 1] && !s.count(v[i]) && up && (sum + v[i] <= m)) {
			s.insert(v[i]);
			sum += v[i];
		} else if (v[i] < v[i - 1] && !s.count(v[i]) && (sum + v[i] <= m)) {
			up = false;
			s.insert(v[i]);
			sum += v[i];
		} else {
			++stacks;
			sum = v[i];
			s = {v[i]};
			up = true;
		}
	}

	cout << n - stacks << endl;
}