#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include<vector>
const int N=2e6+10;
using namespace std;
using ll = long long;
using ull = unsigned long long;
typedef pair<ll,ll> PII;
int t;
ll max_factor;

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

ll bmul(ll a, ll b, ll m) {  // 快速乘
  ull c = (ull)a * (ull)b - (ull)((long double)a / m * b + 0.5L) * (ull)m;
  if (c < (ull)m) return c;
  return c + m;
}

ll qpow(ll x, ll p, ll mod) {  // 快速幂
  ll ans = 1;
  while (p) {
    if (p & 1) ans = bmul(ans, x, mod);
    x = bmul(x, x, mod);
    p >>= 1;
  }
  return ans;
}

bool Miller_Rabin(ll p) {  // 判断素数
  if (p < 2) return false;
  if (p == 2) return true;
  if (p == 3) return true;
  ll d = p - 1, r = 0;
  while (!(d & 1)) ++r, d >>= 1;  // 将d处理为奇数
  for (ll k = 0; k < 10; ++k) {
    ll a = rand() % (p - 2) + 2;
    ll x = qpow(a, d, p);
    if (x == 1 || x == p - 1) continue;
    for (int i = 0; i < r - 1; ++i) {
      x = bmul(x, x, p);
      if (x == p - 1) break;
    }
    if (x != p - 1) return false;
  }
  return true;
}

ll Pollard_Rho(ll x) {
  ll s = 0, t = 0;
  ll c = (ll)rand() % (x - 1) + 1;
  int step = 0, goal = 1;
  ll val = 1;
  for (goal = 1;; goal *= 2, s = t, val = 1) {  // 倍增优化
    for (step = 1; step <= goal; ++step) {
      t = (bmul(t, t, x) + c) % x;
      val = bmul(val, abs(t - s), x);
      if ((step % 127) == 0) {
        ll d = gcd(val, x);
        if (d > 1) return d;
      }
    }
    ll d = gcd(val, x);
    if (d > 1) return d;
  }
}

void fac(ll x) {
  if (x <= max_factor || x < 2) return;
  if (Miller_Rabin(x)) {              // 如果x为质数
    max_factor = max(max_factor, x);  // 更新答案
    return;
  }
  ll p = x;
  while (p >= x) p = Pollard_Rho(x);  // 使用该算法
  while ((x % p) == 0) x /= p;
  fac(x), fac(p);  // 继续向下分解x和p
}

bool tf[N];
vector<int> p;
ll n,x,y;
ll a[N];

void print(__int128 x){
    if(x>=10) print(x/10);
    int t=x%10;
    printf("%d",t);
}

void __(){
    
    srand((unsigned)time(NULL));
    cin>>n>>x>>y;
    for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
    vector<PII> zyz;
    while(x>1){
        max_factor=0;
        fac(x);
        ll cnt=0;
        while(x%max_factor==0){
            cnt++;
            x/=max_factor;
        }
        zyz.push_back({max_factor,cnt});
    }
    __int128 ans=1e30;
    for(auto [j,w]:zyz){
        __int128 tot=0;
        ll res=y;
        while(res>0){
            tot+=res/j;
            res/=j;
        }
        for(int i=1;i<=n;i++){
            ll res=a[i];
            while(res>0){
                tot-=res/j;
                res/=j;
            }
        }
        ans=min(ans,tot/w);
    }
    print(ans);
    puts("");
}

int main() {
    
	srand(time(0));
    for(int i=2;i<N;i++){
        if(!tf[i]) p.push_back(i);
        for(int j=0;1ll*p[j]*i<N;j++){
            tf[i*p[j]]=1;
            if(i%p[j]==0) break;
        }
    }

  cin >> t;
  while (t--) {
    __();
  }
  return 0;
}