#include<bits/stdc++.h>

using namespace std;

const int maxn=1e5+;

typedef long long ll;

int n;ll a,b,c,d;

map<ll,int> vis;

int v[maxn];ll prime[maxn];int cnt,ans;

vector<ll> divisor;

ll gcd(ll a,ll b) {

    return !b ? a : gcd(b, a % b);

}

ll lcm(ll a,ll b) {

    return a * b / gcd(a, b);

}

void sieve() {

    cnt = ;

    memset(v, , sizeof(v));

    for (int i = ; i < maxn; i++) {

        if (!v[i]) {

            v[i] = i;

            prime[cnt++] = i;

        }

        for (int j = ; j < cnt; j++) {

            if (v[i] < prime[j] || i * prime[j] >= maxn) break;

            v[i * prime[j]] = prime[j];

        }

    }

}

void depart(ll d) {

    divisor.clear();

    for (int i = ; prime[i] * prime[i] <= d; i++) {

        while (d % prime[i] == ) {

            divisor.push_back(prime[i]);

            d /= prime[i];

        }

    }

    if (d > )

        divisor.push_back(d);

}

void dfs(ll x,int p,int n) {

    if (p == n) {

        //cout<<x<<endl;

        if (vis[x]) return;

        vis[x] = ;

        if (gcd(a, x) == c && lcm(b, x) == d)

            ans++;

        return;

    }

    dfs(x * divisor[p], p + , n);

    dfs(x, p + , n);

}

//gcd(x,a0)=a1  lcm(x,b0)=b1

int main() {

    sieve();

    cin >> n;

    while (n--) {

        ans = ;

        vis.clear();

        cin >> a >> c >> b >> d;

        depart(d);

        dfs(, , divisor.size());

        cout << ans << endl;

    }

    return ;

}