#include<bits/stdc++.h>
#define int long long
#pragma GCC optimize(2)
using namespace std;
int a[100005];
inline int calc(int p, int l, int r) {
	p = a[p];
	if (p < l) return l - p;
	else if (p > r) return p - r;
	return 0;
}
int n, l, r, ans, cnt, m, k;
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int ll = 0, rr = k - 1; rr <= 600; ll++, rr++) {
		cnt = calc(1, ll, rr), r = 1;
		for (int i = 1; i <= n; i++) {
			if (r < i) {
				cnt = calc(i, ll, rr), r = i;
			}
			while (r < n && cnt + calc(r + 1, ll, rr) <= m) {
				r++;
				cnt += calc(r, ll, rr);
			}
			ans = max(ans, r - i + 1);
			cnt -= calc(i, ll, rr);
		}
	}
	cout << ans;
}