codechef - chef and linear chess

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fast() (ios_base::sync_with_stdio(0),cin.tie(NULL));
int main()
{
    fast();
    int t;
    cin>>t;
    while(t--)
    {
        int n,k;
        cin>>n>>k;
        int ara[n+1],sum=1e9,ans=-1;
        for(int i=0; i<n; i++)
        {
            cin>>ara[i];
            if(k%ara[i]==0)
            {
                int x=k/ara[i]-1;
                if(x<sum)
                {
                    sum=x;
                    ans=ara[i];
                }

            }
        }
        cout<<ans<<endl;
    }
}