/*
 *   Copyright (c) 2024 Emon Thakur
 *   All rights reserved.
 */
#include<bits/stdc++.h>
using namespace std;
void solve()
{
    int n,k,x; cin>>n>>k>>x;
    int a[n],b[n];
    for(int i=0;i<n;i++) cin>>a[i];

    int ans=0,left,right;
    for(int gcd=x+1;gcd<=200;gcd++)
    {
        for(int i=0;i<n;i++)
        {
            b[i] = (gcd-(a[i]%gcd))%gcd;
        }
        //b[0]=5;
        left=0,right=0;
        int rem = k;
        while(right<n)
        {
            if(rem<b[right])
            {
                if(left==right) {left++; right++; continue;}
                rem += b[left];
                ++left;
                continue;
            }
            rem -= b[right];
            ans = max(ans,right-left+1);
            ++right;
        }
        if(ans==n) break;
    }
    cout<<ans<<endl;
}
int main()
{
    solve();
}