#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,p,d;
int a[2000005],q[4000005],l = 2000000,r = 1999999,pre[2000005];
signed main(){
	cin >> n >> p >> d;
	for(int i = 1;i<=n;i++)cin >> a[i];
	int ll = 1,ans = d;q[++r] = d;
	for(int i = 1;i<=n;i++)pre[i] = pre[i-1]+a[i];
	for(int i = d+1;i<=n;i++){
		while(l<=r and pre[i]-pre[i-d]>=pre[q[r]]-pre[q[r]-d])r--;
		q[++r] = i;
	//	cout << i << " " << ll-1 <<" " << q[l] << " " << q[l]-d<<" "<<pre[i]-pre[ll-1]-pre[q[l]]+pre[q[l]-d] << endl;
		while(l<=r and pre[i]-pre[ll-1]-pre[q[l]]+pre[q[l]-d]>p){
			++ll;
			while(l<=r and q[l]-d+1<ll)++l;
		}ans = max(ans,i-ll+1);
	}cout << ans << endl;
}