#include<bits/stdc++.h>
using namespace std;
#define int long long
#define maxn 2000005
int n,p,d,ans;
int a[maxn],s[maxn],t[maxn];
int q[maxn],l = 1,r,lft,rgt,sum;
signed main(){
	cin >> n >> p >> d;
	for(int i = 1;i <= n;i++){
		cin >> a[i];
		s[i] = s[i - 1] + a[i];
	}
	for(int i = d;i <= n;i++)
		t[i] = s[i] - s[i - d];
	ans = d;
	int lft = 1,rgt = 1;
	q[lft] = d;
	rgt++;
	sum = s[d];
	for(int r = d + 1;r <= n;r++){
		sum += a[r];
		while(lft <= rgt && t[q[rgt]] <= t[r]) rgt--;
		q[++rgt] = r;
		while(sum - t[q[lft]] > p){
			if(q[lft] < l + d) lft++;
			sum -= a[l];
			l++; 
		}
		ans = max(ans,r - l + 1);
	}
	cout << ans;
	return 0;
}