// 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);
}

void init() {
    pcnt = 0;
    ll t = x;
    for (int i = 2; i <= 1e6; ++i) {
        if (t % i == 0) {
            c[++pcnt] = 0;
            p[pcnt] = i;
            while (t % i == 0) {
                ++c[pcnt];
                t /= i;
            }
        }
    }

    if (t != 1) {
        bool flag = false;
        for (int i = 1; i <= n; ++i) {
            ll g = gcd(a[i], t);
            if (g != 1 && g != t) {
                ll r = g, s = t / g;
                flag = true;
                if (s == r) {
                    c[++pcnt] = 2;
                    p[pcnt] = s;
                } else {
                    c[++pcnt] = 1;
                    p[pcnt] = s;
                    c[++pcnt] = 1;
                    p[pcnt] = r;
                }
                break;
            }
        }
        if (flag) {
            c[++pcnt] = 1;
            p[pcnt] = t;
        }
    }
}

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

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