#include <bits/stdc++.h>
using namespace std;
inline long long rd() {
  long long x = 0;
  int ch = getchar(), f = 1;
  while (!isdigit(ch) && (ch != '-') && (ch != EOF)) ch = getchar();
  if (ch == '-') {
    f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 1) + (x << 3) + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void rt(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10)
    rt(x / 10), putchar(x % 10 + '0');
  else
    putchar(x + '0');
}
const int maxn = 1000005, S = 1000000, C = 78510;
int mn[maxn], prm[C], pc;
void sieve() {
  for (int i = int(2); i <= (int)(S); i++) {
    if (!mn[i]) prm[mn[i] = ++pc] = i;
    for (int j = int(1); j <= (int)(mn[i]); j++) {
      int k = i * prm[j];
      if (k > S) break;
      mn[k] = j;
    }
  }
}
long long n, m, s, ans;
int a[C], b[C];
int la[20], lb[20], iex[20];
void decom(long long n, int *a, int *la, int f) {
  for (int i = 1; (long long)prm[i] * prm[i] <= n; i++) {
    if (n % prm[i] == 0) {
      la[++*la] = i;
      while (n % prm[i] == 0) a[i] += f, n /= prm[i];
    }
  }
  if (n != 1) la[++*la] = mn[n], a[mn[n]] += f;
}
int ign[C];
void dfs(int nw, long long fac) {
  if (fac > n) return;
  if (nw > *lb) {
    ans++;
    return;
  }
  for (int i = int(0); i <= (int)(b[lb[nw]]); i++)
    dfs(nw + 1, fac), fac *= prm[lb[nw]];
}
int main() {
  sieve();
  for (int t = rd(); t--;) {
    n = rd() * rd() * rd(), m = rd() * rd() * rd(), s = 2 * rd() * rd() * rd(),
    ans = 0;
    *la = *lb = *iex = 0;
    ans = 0;
    decom(n, a, la, 1), decom(s, b, lb, 1);
    dfs(1, 1);
    for (int i = int(1); i <= (int)(*la); i++)
      if (a[la[i]] > b[la[i]]) iex[++*iex] = la[i];
    for (int i = int(0); i <= (int)((1 << *iex) - 1); i++) {
      long long fac = 1;
      int cnt = 0;
      for (int j = int(1); j <= (int)(*iex); j++)
        if ((i >> j - 1) & 1) {
          for (int k = int(1); k <= (int)(b[iex[j]] + 1); k++) {
            if (fac > m) break;
            fac *= prm[iex[j]];
          }
          cnt++;
        }
      if (cnt & 1)
        ans -= m / fac;
      else
        ans += m / fac;
    }
    rt(ans), putchar('\n');
    decom(n, a, ign, -1), decom(s, b, ign, -1);
  }
}
