#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
int n1, n2, n3;
long long n;
int n_[maxn];
int m1, m2, m3;
long long m;
int m_[maxn];
int s1, s2, s3;
long long s;
int s_[maxn];
long long ans;
void divide(int n, int *o) {
  for (int i = 2; i * i <= n; i++)
    if (n % i == 0) {
      while (n % i == 0) o[++o[0]] = i, n /= i;
    }
  if (n > 1) o[++o[0]] = n;
}
void takeaway(int *o) {
  sort(o + 1, o + o[0] + 1);
  o[0] = unique(o + 1, o + o[0] + 1) - o - 1;
}
long long stk[maxn];
int top;
long long count(long long n, long long k) {
  long long res = 0;
  while (n % k == 0) n /= k, ++res;
  return res;
}
long long power(long long n, long long k) {
  long long res = 1ll;
  while (k--) res *= n;
  return res;
}
void work(int stp, long long num, int sig) {
  if (!num) return;
  if (stp > top) {
    ans += sig * num;
    return;
  }
  work(stp + 1, num, sig);
  work(stp + 1, num / stk[stp], sig * -1);
}
long long lim[maxn];
void work2(int stp, long long num) {
  if (!num) return;
  if (stp > s_[0]) {
    ans++;
    return;
  }
  for (int i = 0; i <= lim[stp] && num; i++, num /= s_[stp])
    work2(stp + 1, num);
}
int main() {
  int T;
  for (scanf("%d", &T); T--;) {
    scanf("%d %d %d", &n1, &n2, &n3);
    n_[0] = 0;
    scanf("%d %d %d", &m1, &m2, &m3);
    m_[0] = 0;
    scanf("%d %d %d", &s1, &s2, &s3);
    s_[0] = 0;
    s1 *= 2;
    divide(n1, n_);
    divide(n2, n_);
    divide(n3, n_);
    n = (long long)n1 * n2 * n3;
    divide(m1, m_);
    divide(m2, m_);
    divide(m3, m_);
    m = (long long)m1 * m2 * m3;
    divide(s1, s_);
    divide(s2, s_);
    divide(s3, s_);
    s = (long long)s1 * s2 * s3;
    takeaway(n_);
    takeaway(m_);
    takeaway(s_);
    top = 0;
    for (int i = 1; i <= n_[0]; i++) {
      long long cn = count(n, n_[i]);
      long long cs = count(s, n_[i]);
      if (cn > cs) stk[++top] = power(n_[i], cs + 1);
    }
    ans = 0;
    work(1, m, 1);
    for (int i = 1; i <= s_[0]; i++) lim[i] = count(s, s_[i]);
    work2(1, n);
    printf("%lld\n", ans);
  }
  return 0;
}
