Problem: Mister B has a house in the middle of a giant plain field, which attracted aliens life. For convenience, aliens specified the Cartesian coordinate system on the field in such a way that Mister B's house has coordinates (0, 0). After that they sent three beacons to the field, but something went wrong. One beacon was completely destroyed, while the other two landed in positions with coordinates (m, 0) and (0, n), respectively, but shut down.

Mister B was interested in this devices, so he decided to take them home. He came to the first beacon, placed at (m, 0), lifted it up and carried the beacon home choosing the shortest path. After that he came to the other beacon, placed at (0, n), and also carried it home choosing the shortest path. When first beacon was lifted up, the navigation system of the beacons was activated.

Partially destroyed navigation system started to work in following way.

At time moments when both survived beacons are at points with integer coordinates the system tries to find a location for the third beacon. It succeeds if and only if there is a point with integer coordinates such that the area of the triangle formed by the two survived beacons and this point is equal to s. In this case the system sends a packet of information with beacon positions to aliens, otherwise it doesn't.

Compute how many packets of information system sent while Mister B was moving the beacons.

Input

The first line contains one integer t (1 ≤ t ≤ 1000) — the number of test cases. The next 3·t lines describe t test cases. 

Every test case is described in three lines as follows. Note that each parameter is given as a product of three factors.

The first line of a test case contains three space-separated integers: n1, n2, n3 (1 ≤ ni ≤ 106) such that n = n1·n2·n3.

The second line contains three space-separated integers: m1, m2, m3 (1 ≤ mi ≤ 106) such that m = m1·m2·m3.

The third line contains three space-separated integers: s1, s2, s3 (1 ≤ si ≤ 106) such that s = s1·s2·s3.

Note that for hacks only tests with t = 1 allowed.

Output

Print t integers one per line — the answers for each test.

Example

Input

3
2 1 1
2 1 1
1 1 3
1 5 1
2 2 1
1 1 2
10 6 18
2 103 2
13 1 13


Output

4
7
171

Note

First test case contains the following beacon positions: (2, 0) and (0, 2), s = 3. The following packets could be sent: ((2, 0), (0, 2), ( - 1, 0)), ((1, 0), (0, 2), (4, 0)), ((0, 0), (0, 2), (3, 1)), ((0, 0), (0, 1), ( - 6, 0)), where (b1, b2, p) has next description: b1 — first beacon position, b2 — second beacon position, p — some generated point.

Second test case contains the following beacon initial positions: (4, 0) and (0, 5), s = 2. The following packets could be sent: ((4, 0), (0, 5), (0, 4)), ((3, 0), (0, 5), (2, 3)), ((2, 0), (0, 5), (2, 2)), ((1, 0), (0, 5), (1, 4)), ((0, 0), (0, 4), (0, - 1)), ((0, 0), (0, 2), (2, 0)), ((0, 0), (0, 1), (4, 0)).

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000005;
long long N, M;
bool vis[MAXN];
vector<int> fac[MAXN];
vector<pair<int, int> > sfac;
vector<long long> nfac;
long long ans;
long long get_pow(int a, int x) {
  long long ret = 1;
  while (x--) ret *= a;
  return ret;
}
void preprocess(int n) {
  for (int i = 2; i <= n; i++)
    if (!vis[i])
      for (int j = i; j <= n; j += i) {
        vis[j] = true;
        fac[j].push_back(i);
      }
}
void dfs1(int cur, long long now) {
  if (cur >= sfac.size()) {
    ans++;
    return;
  }
  for (int i = 0; i <= sfac[cur].second; i++) {
    dfs1(cur + 1, now);
    now *= sfac[cur].first;
    if (now > N) return;
  }
}
void dfs2(int cur, int sgn, long long now) {
  if (cur >= nfac.size()) {
    ans += M / now * sgn;
    return;
  }
  dfs2(cur + 1, sgn, now);
  dfs2(cur + 1, -sgn, now * nfac[cur]);
}
void solve() {
  int n[3], m[3], s[3];
  for (int i = 0; i < 3; i++) scanf("%d", &n[i]);
  N = 1;
  for (int i = 0; i < 3; i++) N *= n[i];
  for (int i = 0; i < 3; i++) scanf("%d", &m[i]);
  M = 1;
  for (int i = 0; i < 3; i++) M *= m[i];
  for (int i = 0; i < 3; i++) scanf("%d", &s[i]);
  map<int, int> f;
  for (int i = 0; i < 3; i++) {
    int x = s[i];
    for (int j = 0; j < fac[s[i]].size(); j++) {
      int d = fac[s[i]][j];
      while (x % d == 0) {
        x /= d;
        f[d]++;
      }
    }
  }
  f[2]++;
  sfac.clear();
  for (map<int, int>::iterator it = f.begin(); it != f.end(); ++it)
    sfac.push_back(*it);
  ans = 0;
  dfs1(0, 1);
  map<int, int> f2;
  for (int i = 0; i < 3; i++) {
    int x = n[i];
    for (int j = 0; j < fac[n[i]].size(); j++) {
      int d = fac[n[i]][j];
      while (x % d == 0) {
        x /= d;
        f2[d]++;
      }
    }
  }
  nfac.clear();
  for (map<int, int>::iterator it = f2.begin(); it != f2.end(); ++it) {
    int d = it->first;
    if (f[d] < it->second) nfac.push_back(get_pow(d, f[d] + 1));
  }
  dfs2(0, 1, 1);
  printf("%lld\n", ans);
}
int main() {
  preprocess(1000000);
  int T;
  scanf("%d", &T);
  while (T--) solve();
  return 0;
}