#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+10;
int n;ll m;
ll l[N];

namespace subtask1{
	void solve(){
		int ans=0;
		ll sum=0;int cnt=0;
		for(int i=1;i<=n;i++){
			sum=cnt=0;
			for(int j=i;j<=n;j++){
				sum+=l[j];
				if(sum==m)sum=0,cnt++;
				else if(sum>m)break;
			}
			ans=max(ans,cnt);
		}
		printf("%d\n",ans);
	}
}

namespace subtask2{
	int f[N],pre[N];
	ll sum[N];
	void solve(){
		for(int i=1;i<=n;i++)sum[i]=sum[i-1]+l[i];
		
//		for(int i=1;i<=n;i++)cout<<sum[i]<<" ";cout<<endl;
		
		for(int i=1;i<=n;i++){
			int j=lower_bound(sum,sum+1+i,sum[i]-m)-sum;
//			cout<<"i: "<<i<<" j: "<<j<<endl;
//			cout<<"sum[i]: "<<sum[i]<<endl;
			if(sum[j]+m!=sum[i])pre[i]=-1;
			else pre[i]=j;
		}
		
		for(int i=1;i<=n;i++){
			if(pre[i]>0)f[i]=f[pre[i]]+1;
			else if(pre[i]==0)f[i]=1;
		}
		printf("%d\n",*max_element(f+1,f+1+n));
		
//		for(int i=1;i<=n;i++)cout<<pre[i]<<" ";cout<<endl;
	}
}

int main(){
	
//	freopen("tape.in","r",stdin);
//	freopen("tape.out","w",stdout);
	
	scanf("%d %lld",&n,&m);
	
	for(int i=1;i<=n;i++)scanf("%lld",&l[i]);
	
	if(n<=5000)
		subtask1::solve();
	else 
		subtask2::solve();
			
	return 0;
}