/*(^-^)*/
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<ctime>
#include<cstdio>
#include<vector>
#include<cctype>
#include<string>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long

int n,a0,a1,b0,b1,sum;//好气啊啊啊啊为什么long long就TLE一个点，int就A啊！！！！！ 

int gcd(int a,int b)
{
    return b==0?a:gcd(b,a%b);
}

int lcm(int a,int b)
{
    return a/gcd(a,b)*b;
}

int main()
{
	freopen("son.in","r",stdin);
	freopen("son.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        sum=0;
        scanf("%d %d %d %d",&a0,&a1,&b0,&b1);
        int c=sqrt(b1);
        for(int j=1;j<=c;j++)
        {
            if(b1%j==0)
            {
                if(gcd(a0,j)==a1&&lcm(b0,j)==b1)sum++;
                if(j!=b1/j)
                {
                    if(gcd(a0,b1/j)==a1&&lcm(b0,b1/j)==b1)sum++;
                }
                
            }
        }
        printf("%d\n",sum);
    }
    return 0;
}