#include<bits/stdc++.h>
typedef long long   ll;
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout<<it<<" "; cout<<endl;
#define _ASRafi__   ios::sync_with_stdio(false); cin.tie(0);
using namespace std;

void solve()
{
    ll n, k, x, ans = 0;
    cin >> n >> k >> x;
    vector<ll> v(n);
    for (int i = 0; i < n; i++)
    {
        cin >> v[i];        
    }
    for(int gcd = x + 1; gcd <= 100; gcd++)
    {
        vector<ll> preNeed(n);
        for(int i = 0; i < n; i++)
        {
            ll xx = (gcd - (v[i] % gcd)) % gcd;
            preNeed[i] = xx;
            if(i) preNeed[i] += preNeed[i - 1];
        }
        // cout << gcd << " => ";
        // coutall(preNeed);
        for(int i = 0; i < n; i++)
        {
            ll kk = k;
            if(i) kk += preNeed[i - 1];
            ll j = (--upper_bound(all(preNeed), kk)) - (preNeed.begin() + i);
            ans = max(ans, j + 1);
            // cout << i << " => " << j + 1 << endl;
        }
    }
    cout << ans << endl;
    return;
}

int32_t main()
{
    _ASRafi__;
    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++)
    {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}