#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;

const int N = 1e4 + 7;

bool cmp(pair<ll, ll> &a, pair<ll, ll> &b) 
{ 
    if(a.F != b.F) return a.F < b.F;
    else return a.S > b.S;
} 

void solve()
{
    ll n, k;
    cin >> n;
    vector<ll> v(n), divCnt(N);
    for (int i = 0; i < n; i++)
    {
        ll x; cin >> x;
        v[i] = x;
    }
    cin >> k;
    for(auto &i: v)
    {
        for(auto &j: v)
        {
            if(i % j == 0) divCnt[i] += 1;
        }
    }
    vector<pair<ll, ll>> vpp;
    for(auto &i: v)
    {
        vpp.pb({divCnt[i], i});
    }
    sort(all(vpp), cmp);
    cout << vpp[k - 1].S << endl;
    return;
}
int32_t main()
{
    _ASRafi__;
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++)
    {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}