/**
	Author: 丘成桐(囯内)
**/
#include<bits/stdc++.h>
#define int long long
using namespace std;
void ts(){cout<<"IAKIOI\n";}
int n,p,d;
int a[2000005];
//选择 d 的区间.
int pre[2000005];
//[j,j+d-1]
int pp[2000005];
bool check(int x){
	deque<int> q;
	for(int i=1;i<=x-d+1;i++){
		while(!q.empty()&&q.back()<pp[i])q.pop_back();
		q.push_back(pp[i]);
	}
	if(pre[x]-q.front()<=p)return 1;
	for(int i=2;i<=n-x+1;i++){
		int cur=pre[i+x-1]-pre[i-1];
		while(!q.empty()&&q.back()<pp[i+x-d])q.pop_back();
		q.push_back(pp[i+x-d]);
		if(q.front()==pp[i-1])q.pop_front();
		cur-=q.front();
		if(cur<=p)return 1;
		//选择里面和最大的.
		//
	}
	return 0;
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0);
	cin>>n>>p>>d;
	for(int i=1;i<=n;i++)cin>>a[i],pre[i]=pre[i-1]+a[i];
	for(int i=1;i<=n-d+1;i++)pp[i]=pre[i+d-1]-pre[i-1];
	int l=d,r=n;
	int res=-1;
	while(l<=r){
		int mid=(l+r)/2;
		if(check(mid)){res=mid,l=mid+1;}
		else r=mid-1;
	}
	cout<<res<<"\n";
	return 0;
}