#include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstdio>
#include<string>
#include<deque>
#include<stack>
#include<queue>
#include<vector>
#include<stdio.h>
#include<map>
#include<set>
#include<string.h>
#include<time.h>
#include<stdlib.h>
#include<bitset>
#define int long long
using namespace std;
const int N=sqrt(2e9+50);
int shi[N];
int su[65000],tot;
int t;
int a,b,c,d;
signed main(){
	for(int i=2;i<=N;i++){
		if(shi[i]==1)continue;
		su[++tot]=i;
		int j=i*2;
		while(j<=N){
			shi[j]=1;
			j+=i;
		}
	}
	cin>>t;
	while(t--){
		long long ans=1;
		cin>>a>>c>>b>>d;
		int ma=0,mb=0,mc=0,md=0;
		for(int i=1;i<=tot;i++){
			ma=mb=mc=md=0;
			while(a%su[i]==0){
				ma++;
				a/=su[i];
			}
			while(b%su[i]==0){
				mb++;
				b/=su[i];
			}
			while(c%su[i]==0){
				mc++;
				c/=su[i];
			}
			while(d%su[i]==0){
				md++;
				d/=su[i];
			}
			if(ma>mc){
				if(mb<md&&mc==md)ans*=1;
				else if(mb==md&&mc<=md){
					ans*=1;
				}else{
					ans=0;
				}
			}else if(ma==mc){
				if(mb>md)ans=0; 
				else{
					if(mb<md&&mc<=md)ans*=1;
					else if(mb==md&&mc<=md)ans*=(md-mc+1);
					else ans=0;
				}
			}else{
				ans=0;
			}
		}
		cout<<ans<<endl;
	}
	
	return 0;
}