#include<cstdio>

#include<algorithm>

#define N 2000010

#define rg register

#define LL long long

using namespace std;

LL n,m,d,a[N],h[N],s[N],p[N],tmp;

int ans;

inline LL read(){

	LL k=0; char c=getchar();

	while(c<'0'||c>'9')c=getchar();

	while('0'<=c&&c<='9')k=k*10+c-'0',c=getchar();

	return k;

}

inline int max(int x,int y){

	return x>y?x:y;

}

int main(){

	n=read(); m=read(); ans=d=read();

	for(rg int i=1;i<=n;i++) a[i]=read(),s[i]=s[i-1]+a[i];

	if(n<=d) return printf("%d\n",d),0;

	int l=1,front=1,rear=0;

	for(rg int i=d+1;i<=n;i++){

		tmp=s[i]-s[i-d];

		while(front<=rear&&h[rear]<=tmp) rear--;

		h[++rear]=tmp; p[rear]=i-d+1;

		while(p[front]<l&&front<=rear) front++;

		while(l<=i-d+1){

			if(front<=rear) tmp=s[i]-s[l-1]-h[front];

			else tmp=s[i]-s[l-1];

			if(tmp<=m){

				ans=max(ans,i-l+1);

				break;

			}

			else l++;

		}

		tmp=s[i]-s[l-1];

	}

	printf("%d\n",ans);

	return 0;

}