#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,d;
ll p,a[2000005],pre[2000005],sd[2000005];
int q[2000005],l,r;
ll read(){
	char c=getchar();
	ll tmp=0;
	while(c<'0' || c>'9')c=getchar();
	while(c>='0' && c<='9'){
		tmp=(tmp<<3)+(tmp<<1)+(c-'0');
		c=getchar();
	}
	return tmp;
}
int main(){
	n=read();p=read();d=read();
	for(int i=1;i<=n;i++)a[i]=read();
	for(int i=1;i<=n;i++)pre[i]=pre[i-1]+a[i];
	for(int i=d;i<=n;i++)sd[i]=pre[i]-pre[i-d];
	pre[n+1]=1e18;
	int L=1,R=d;
	l=r=1,q[1]=d;
	while(pre[R]-pre[L-1]-sd[q[l]]<=p){
		R++;
		while(r>=l && sd[q[r]]<=sd[R])r--;
		q[++r]=R;
	}
	int ans=R-L;
	for(int i=1;i<=n-d;i++){
		L++;
		if(q[l]<i+d)l++;
		while(pre[R]-pre[L-1]-sd[q[l]]<=p){
			R++;
			while(r>=l && sd[q[r]]<=sd[R])r--;
			q[++r]=R;
		}
//		printf("%d %d\n",L,R);
		ans=max(ans,R-L);
	}
	printf("%d",ans);
	return 0;
}
/*
10 2 3
5 5 5 5 5 1 1 1 1 1
*/