#include <bits/stdc++.h>
using namespace std;
#define SC               scanf
#define PF               printf
#define ull              unsigned long long
#define ld               long double
#define F                first
#define S                second
#define pb               push_back
#define sort_a(a)        sort(a.begin(),a.end());
#define sort_d(a)        sort(a.rbegin(),a.rend());
#define READ(f)          freopen(f, "r", stdin)
#define WRITE(f)         freopen(f, "w", stdout)
#define rev(s)           reverse(s.begin(),s.end())
#define P(ok)            cout << (ok ? "YES\n": "NO\n")
#define __Heart__              ios_base :: sync_with_stdio(false); cin.tie(NULL);
#define ll long long
typedef pair< ll , ll>                   PII;
const int sz = 1e5 + 5 ;
int a[sz] ;
int preCalc[105][sz] ;
void solve()
{

     int n , K , x , Ans = 0 , flag = 1; cin >> n >> K >> x ;
     for(int i = 101 ; i > x ; i--){
         for(int j = 0 ; j < n ; j++) preCalc[i][j] = 0 ;
     }
     for(int i = 1 ; i <= n ; i++) cin >> a[i] ;
     for(int i = 101 ; i > x; i--){
         for(int j = 1 ; j <= n ; j++){
             int div = a[j] / i ;
             if(a[j] % i) div++ ;
             int nextVal = i * div ;
             preCalc[i][j] = (nextVal - a[j]) ;
         }
     }
     for(int i = 101 ; i > x ; i--){
            int cnt = 0 , sum = 0 ;
         for(int j = 1 ; j <= n ; j++) {

            if(preCalc[i][j] <= K){
                cnt++ ;
                sum += preCalc[i][j] ;
                if(sum + preCalc[i][j] > K) {
                     while(sum > K){
                        sum -= preCalc[i][j - cnt + 1] ;
                        cnt-- ;
                     }
                }
                Ans = max(Ans, cnt) ;
            }
            else {
                cnt = 0 ;
                sum = 0 ;
                continue ;
            }

         }
     }
     cout << Ans << endl ;

}
int main()
{
     __Heart__
     int t ; t = 1 ; while(t--) solve() ;
}