#include <bits/stdc++.h>
using namespace std;
const double pi = acos(0.0) * 2.0;
const long double eps = 1e-10;
const int step[8][2] = {{-1, 0}, {0, 1}, {1, 0},  {0, -1},
                        {-1, 1}, {1, 1}, {1, -1}, {-1, -1}};
template <class T>
inline T abs1(T a) {
  return a < 0 ? -a : a;
}
template <typename t, typename t1>
t min1(t a, t1 b) {
  return a < b ? a : b;
}
template <typename t, typename... arg>
t min1(t a, arg... arr) {
  return min1(a, min1(arr...));
}
template <typename t, typename t1>
t max1(t a, t1 b) {
  return a > b ? a : b;
}
template <typename t, typename... arg>
t max1(t a, arg... arr) {
  return max1(a, max1(arr...));
}
inline int jud(double a, double b) {
  if (abs(a) < eps && abs(b) < eps)
    return 0;
  else if (abs1(a - b) / max(abs1(a), abs1(b)) < eps)
    return 0;
  if (a < b) return -1;
  return 1;
}
template <typename t>
inline int jud(t a, t b) {
  if (a < b) return -1;
  if (a == b) return 0;
  return 1;
}
template <typename it, typename t1>
inline int find(t1 val, it a, int na, bool f_small = 1, bool f_lb = 1) {
  if (na == 0) return 0;
  int be = 0, en = na - 1;
  if (*a <= *(a + na - 1)) {
    if (f_lb == 0)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != 1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != -1)
          en = mid;
        else
          be = mid + 1;
      }
    if (f_small && jud(*(a + be), val) == 1) be--;
    if (!f_small && jud(*(a + be), val) == -1) be++;
  } else {
    if (f_lb)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != -1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != 1)
          en = mid;
        else
          be = mid + 1;
      }
    if (!f_small && jud(*(a + be), val) == -1) be--;
    if (f_small && jud(*(a + be), val) == 1) be++;
  }
  return be;
}
template <class T>
inline T lowb(T num) {
  return num & (-num);
}
inline int bitnum(unsigned int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(unsigned long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitnum(long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitmaxl(unsigned int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(unsigned long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
inline int bitmaxl(long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
long long pow(long long n, long long m, long long mod = 0) {
  if (m < 0) return 0;
  long long ans = 1;
  long long k = n;
  while (m) {
    if (m & 1) {
      ans *= k;
      if (mod) ans %= mod;
    }
    k *= k;
    if (mod) k %= mod;
    m >>= 1;
  }
  return ans;
}
template <class t1, class t2>
inline void add(t1 &a, t2 b, int mod = -1) {
  if (mod == -1) mod = 1000000007;
  a += b;
  while (a >= mod) a -= mod;
  while (a < 0) a += mod;
}
template <class t>
void output1(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) cerr << arr[i] << ' ';
  cerr << endl;
}
template <class t>
void output2(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) output1(arr[i]);
}
const int maxn = 1000100;
pair<int, int> last[maxn];
map<int, int> prin, prim, pris;
long long n, m, s;
long long ans;
void get(long long a, map<int, int> &dp) {
  for (int i = a; last[i].first != -1;) {
    dp[last[i].first] += last[i].second;
    for (int j = last[i].second, p = last[i].first; j > 0; j--) i /= p;
  }
}
void rget(long long &p, map<int, int> &dp) {
  for (int i = 0; i < 3; i++) {
    int num;
    scanf("%d", &num);
    p *= num;
    get(num, dp);
  }
}
void dfs(long long rnum, map<int, int>::iterator it) {
  if (it == pris.end()) {
    ans++;
    return;
  }
  for (int i = 0; i <= it->second; i++) {
    if (rnum > n) break;
    it++;
    dfs(rnum, it);
    it--;
    rnum *= it->first;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  memset(last, -1, sizeof(last));
  for (int i = 2; i < maxn; i++)
    if (last[i].first == -1) {
      for (int j = i; j < maxn; j += i) {
        last[j].first = i;
      }
    }
  for (int i = 2; i < maxn; i++) {
    last[i].second = 0;
    for (int j = i; j % last[i].first == 0; j = j / last[i].first) {
      last[i].second++;
    }
  }
  int ncase;
  scanf("%d", &ncase);
  for (int i1 = 0; i1 < ncase; i1++) {
    prin.clear();
    prim.clear();
    pris.clear();
    n = m = s = 1;
    rget(n, prin);
    rget(m, prim);
    rget(s, pris);
    s *= 2;
    pris[2]++;
    ans = 0;
    vector<long long> rv;
    for (auto it : prin) {
      auto rit = pris.find(it.first);
      if (rit == pris.end() || rit->second < it.second) {
        rv.push_back(pow(it.first, rit == pris.end() ? 1 : rit->second + 1, 0));
      }
    }
    ans = 0;
    for (int i = 0; i < 1 << rv.size(); i++) {
      int flag = 1;
      long long rnum = 1;
      for (int j = 0; j < (int)rv.size(); j++)
        if (i & (1 << j)) {
          flag = -flag;
          rnum *= rv[j];
        }
      ans += m / rnum * flag;
    }
    dfs(1, pris.begin());
    cout << ans << endl;
  }
  return 0;
}
