#include <cstdio>
#include <algorithm>
#define LL long long
using namespace std;
const int N = 3e6 + 5, INF = 1e18;
LL a[N], s[N], q[N], sz[N], n, d, p, hh, tt, ans;
bool check(int x) {
	LL res = INF;
	hh = 1;
	tt = 0;
	for (int i = d; i <= n; i ++ ) {
		while (hh <= tt && q[hh] < i - x + d) hh ++ ;
		while (hh <= tt && sz[q[tt]] < sz[i]) tt -- ;
		q[ ++ tt] = i;
		if (i >= x) res = min(res, s[i] - s[i - x] - sz[q[hh]]);
	}
	return res <= p;
}
int main() {
   	scanf("%lld%lld%lld", &n, &p, &d);
   	for (int i = 1; i <= n; i ++ ) {
 		int x;
 		scanf("%d", &x);
 		s[i] = s[i - 1] + x;
   	}
   	for (int i = d; i <= n; i ++ ) sz[i] = s[i] - s[i - d];
   	LL l = 0, r = n + 1;
   	while (l <= r) {
   		int mid = (l + r) / 2;
   		if (check(mid)) {
   			l = mid + 1;
	   		ans = mid;
		}
   		else r = mid - 1;
   	}
   	printf("%d\n", ans);
   	return 0;
}