#include<bits/stdc++.h>
using namespace std;

#define int long long

int X,Y,A,B,swa;

inline bool solve2(){
	vector<int> factor;
	for( int p = 1 ; p * p < X ; p ++ )
		if( ( X - Y ) % p == 0 ) factor.emplace_back( p );//cerr << p << "\n";
	for( int p : factor ){
		int L = max( X / ( p + 1 ) , ( X * p + X - Y ) / ( p * p + p ) ) + 1;
		L = max( L , 2 + ( X - Y ) / p );
		int R = min( min( A , X ) , min( B + ( X - Y ) / p , Y + ( X - Y ) / p ) );
		R = min( R , X / p );
		if( L <= R ){
			int a = ( L + R ) >> 1,b = ( Y - X ) / p + a;
			if( swa ) swap( a , b );
			printf("YES\n%lld %lld\n",a,b);
			return 1;
		}
	}
	return 0;
}

vector< vector<int> > Fa,Fb;

inline bool solve3(){
	int lenA = 0,lenB = 0;
	Fa.clear(),Fb.clear();
	Fa.emplace_back( vector<int>() ),Fb.emplace_back( vector<int>() );
	for( int a = 2 ; a <= A && a * a <= X ; a ++ ){
		Fa.emplace_back( vector<int>() ),lenA ++;
		int tmp = X;
		while( tmp ) Fa[lenA].emplace_back( tmp % a ),tmp /= a;
	}
	for( int b = 2 ; b <= B && b * b <= Y ; b ++ ){
		Fb.emplace_back( vector<int>() ),lenB ++;
		int tmp = Y;
		while( tmp ) Fb[lenB].emplace_back( tmp % b ),tmp /= b;
	}
	int ptb = 1;
	for( int pta = 1 ; pta <= lenA ; pta ++ ){
		while( ptb <= lenB && Fb[ptb].size() > Fa[pta].size() ) ptb ++;
		if( ptb > lenB ) return 0;
		int LEN = Fa[pta].size(),flg = 0;
		for( int j = 0 ; j < LEN ; j ++ )
			if( Fa[pta][j] != Fb[ptb][j] ){ flg = 1; break; }
		if( !flg ){
			if( swa ) swap( pta , ptb );
			printf("YES\n%lld %lld\n",pta + 1,ptb + 1);
			return 1;
		}
	}
	return 0;
}

inline void solve(){
	scanf("%lld%lld%lld%lld",&X,&Y,&A,&B);
	if( X == Y ){ printf("YES\n2 2\n"); return; }
	if( X < Y ) swap( X , Y ),swap( A , B ),swa = 1; else swa = 0;
	if( !solve2() ){ if( !solve3() ) printf("NO\n"); }
}

signed main(){
	int testcase; scanf("%lld",&testcase);
	while( testcase -- ) solve();
	return 0;
}