#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin>>n>>k;
vector<int> m;
for (int i=0;i<n;i++){
	int x;
	cin>>x;
	m.push_back(x);
}
int sum=m[0];
set<int> s;
int ans=0; 
s.insert(m[0]); 
bool voltefopont=false; 
for (int i=1; i<n;i++){
	if (m[i]<m[i-1] && !voltefopont) voltefopont=true; 
	if (voltefopont && m[i]>m[i-1] or (sum+m[i]>k or s.find(m[i])!=s.end())){
		sum=0; 
		voltefopont=false;
		ans++;
		s.clear(); 
	}  
	sum+=m[i];
	s.insert(m[i]);
}
cout<<n-ans-1; 
}