1 #include <cstdio>
 2 #include <cstdlib>
 3 #include <cstring>
 4 #include <iostream>
 5 #include <algorithm>
 6  
 7 using namespace std;
 8  
 9 #define gc getchar
10 #define add(x,y) x=x*10+y-‘0‘
11  
12 template <class T>
13 __inline void read(T &x)
14 {
15     x = 0; char c = gc();
16      
17     while (c < ‘0‘)
18         c = gc();
19      
20     while (c >= ‘0‘)add(x,c),
21         c = gc();
22 }
23  
24 #define mem(x) memset(x,0,sizeof(x))
25 #define rep(x) for(int i=1;i<=x;++i)
26  
27 #define ll long long
28 #define LL long long
29  
30 #define N 4000005
31  
32 int n;
33 int d;
34 int num[N];
35 int que[N];
36  
37 LL p;
38 LL sum[N];
39 LL mex[N];
40  
41 signed main(void)
42 {
43     read(n);
44     read(p);
45     read(d);
46      
47     rep(n)read(num[i]);
48     rep(n)sum[i] = sum[i - 1] + num[i];
49     rep(n - d + 1)mex[i] = sum[i + d - 1] - sum[i - 1];
50      
51     int h = 0, t = 0, lt = 0, ans = 0;
52      
53     for (int i = d; i <= n; ++i)
54     {
55         while (h < t && mex[que[t - 1]] <= mex[i - d + 1])
56             --t;
57              
58         que[t++] = i - d + 1;
59          
60         while (sum[i] - sum[lt] - mex[que[h]] > p)
61         {
62             ++lt; while (que[h] <= lt)++h;
63         }
64          
65         if (i - lt > ans)ans = i - lt;
66     }
67      
68     printf("%d\n", ans);
69 }