// 13:25
#include <bits/stdc++.h>

typedef long long ll;

const int N = 1e5 + 5;
int n;
ll x, y;

ll a[N];
ll p[505], c[505], pcnt;


ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

struct Pollard_Rho
{
    ll md(ll x, ll p){while(x>p)x-=p;return x;}
    ll mult(ll a, ll b, ll p)
    {
        ll ans=0, t=a;
        for(;b;b>>=1,t=md(t+t,p))if(b&1)ans=md(ans+t,p);
        return ans;
    }
    ll pow(ll a, ll b, ll p)
    {
        ll ans=1, t=a;
        for(;b;b>>=1,t=mult(t,t,p))if(b&1)ans=mult(ans,t,p);
        return ans;
    }
    bool MR(ll n)
    {
        ll a, t, u, i, x, y, tim=20;
        if(n==2)return true;
        if(~n&1)return false;
        if(n==3 or n==5)return true;
        if(n%3==0 or n%5==0)return false;
        for(t=0,u=n-1;~u&1;u>>=1,t++);
        while(tim--)
        {
            a=rand()%(n-1)+1;
            for(y=x=pow(a,u,n),i=1;i<=t;i++)
            {
                x=mult(x,x,n);
                if(x==1 and y!=n-1 and y!=1)return false;
                y=x;
            }
            if(x!=1)return false;
        }
        return true;
    }
    ll pollard_rho(ll n, ll c)
    {
        ll i, k, x=rand()%n, y=x, d;
        for(i=1,k=2;;i++)
        {
            x=(mult(x,x,n)+c)%n;
            d=gcd(y>x?y-x:x-y,n);
            if(d>1 and d<n)return d;
            if(x==y)return n;
            if(i==k)y=x,k<<=1;
        }
    }
    void find(ll n, ll c, std::map<ll,ll>& ans)
    {
        if(n==1)return;
        if(MR(n)){ans[n]++;return;}
        ll p=pollard_rho(n,c);
        for(;p==n;c++)p=pollard_rho(n,c);
        find(p,c,ans), find(n/p,c,ans);
    }
    std::map<ll,ll> run(ll n)
    {
        std::map<ll,ll> ans;
        find(n,1,ans);
        return ans;
    }
};

void init() {
    pcnt = 0;
    Pollard_Rho pr;
    auto mp = pr.run(x);
    for (auto [pri, cnt] : mp) {
        p[++pcnt] = pri;
        c[pcnt] = cnt;
    }
}

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%d%lld%lld", &n, &x, &y);
        init();
        // printf("pcnt=%lld\n", pcnt);
        // for (int i = 1; i <= pcnt; ++i) {
        //     printf("%lld %lld\n", p[i], c[i]);
        // }
        for (int i = 1; i <= n; ++i) {
            scanf("%lld", &a[i]);
        }

        ll ans = 1e18;
        for (int i = 1; i <= pcnt; ++i) {
            ll tot = 0, t = y;
            while (t / p[i]) {
                tot += t / p[i];
                t /= p[i];
            }

            for (int j = 1; j <= n; ++j) {
                t = a[j];
                while (t / p[i]) {
                    tot -= t / p[i];
                    t /= p[i];
                }
            }

            ans = std::min(ans, tot / c[i]);
        }
        printf("%lld\n", ans);
    }
    return 0;
}