#include <iostream>
#include <vector>
#include <set>

using namespace std;

int main()
{
	int n, m, i, last, begin, out = 0, sum;
	cin >> n >> m;

	vector<int> boxes(n);

	for (i = 0; i < n; i++)
	{
		cin >> boxes[i];
	}

	i = 1, last = boxes[0], sum = boxes[0], begin = 0;

	set<int> stacksizes;
	stacksizes.insert(boxes[0]);

	while (i < n)
	{
		while (i < n && boxes[i] > last && m >= sum + boxes[i])//sum nem jó
		{
			stacksizes.insert(boxes[i]);
			last = boxes[i];
			sum += boxes[i];
			i++;
		}

		while (i < n && last > boxes[i] && !stacksizes.count(boxes[i]) && m >= sum + boxes[i])
		{
			last = boxes[i];
			sum += boxes[i];
			stacksizes.insert(boxes[i]);
			i++;
		}

		out += i - begin - 1;

		if (i < n)
		{
			begin = i;
			sum = boxes[i];
			stacksizes = { boxes[i] };
			last = boxes[i];
			i++;
		}
	}

	cout << out;
}
//12 16
//1 3 5 4 2 6 8 7 6 5 3 4