#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e5+5,M=N*40+5,K=600+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int x,y,A,B;
vector<pair<vector<int>,int> > a,b;
void print(int X,int Y){
	while(x||y){
		// assert(x%X==y%Y);
		x/=X;y/=Y;
	}
	printf("YES\n%d %d\n",X,Y);
}
void Solve(){
	int i,j;scanf("%d%d%d%d",&x,&y,&A,&B);
	if(x==y) {printf("YES\n2 2\n");return;}
	int X=sqrt(x)-eps,Y=sqrt(y)-eps;
	a.clear();b.clear();
	for(i=2;i<=A&&i<=X;i++) {
		vector<int> c;
		int z=x;for(j=0;z;j++) c.emplace_back(z%i),z/=i;
		a.emplace_back(c,i);
	}
	for(i=2;i<=B&&i<=Y;i++) {
		vector<int> c;
		int z=y;for(j=0;z;j++) c.emplace_back(z%i),z/=i;
		b.emplace_back(c,i);
	}
	sort(a.begin(),a.end());sort(b.begin(),b.end());
	while(!a.empty()&&!b.empty()){
		if(a.back().fi==b.back().fi){
			print(a.back().se,b.back().se);return;
		}
		if(a.back().fi<b.back().fi) b.pop_back();
		else a.pop_back();
	}
	X=max(X+1,2);Y=max(Y+1,2);
	while(X<=A&&Y<=B&&X<=x&&Y<=y){
		int l=min(A,x/(x/X)),r=min(B,y/(y/Y));
		if(x/X!=y/Y){
			if(x/X<y/Y) Y=r+1;else X=l+1;
			continue;
		}
		// cerr<<X<<' '<<Y<<'\n';
		int xl=x%X,xr=x%l,yl=y%Y,yr=y%r;
		if(xl%(x/X)==yl%(y/Y)&&max(xr,yr)<=min(xl,yl)) {
			int z=min(xl,yl);
			print(X+(xl-z)/(x/X),Y+(yl-z)/(y/Y));
			return;
		}
		x=l+1;y=r+1;
	}
	puts("NO");
}
int main(){
	int t;
	scanf("%d",&t);
	// t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}