#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<(b);++i)
using namespace std;
using pii = pair<int,int>;
using ll = long long;
using ull = unsigned long long;
using lll = __int128;
using pll = pair<ll,ll>;
using vi = vector<int>;

#define fr first 
#define sc second

using ld = long double;

#define all(x) (x).begin(), (x).end()

const int maxn = 5000+10, inf = 1e9+100;
const ll linf = 4e18+100;
const int mod = 998244353;

vector<int> eval(int x,int b){
	vi v;
	while(x){
		v.push_back(x%b);
		x/=b;
	}
	reverse(all(v));
	return v;
}

bool comp(vector<int> va, vector<int> vb){
	if(va.size()!=vb.size())return va.size()<vb.size();
	return va<vb;
}


void solve () {
	int x,y,a,b;
	cin >> x >> y >> a >> b;
	bool swapped = false;
	if(x>y){
		swapped=true;
		swap(x,y);
		swap(a,b);
	}
	auto report = [&](int a,int b){
		if(swapped)swap(a,b);
		cout << "YES\n" << a << " " << b << "\n";
	};
	if(x==y){
		report(2,2);
		return;
	}
	// two digit
	for(int i = 1;true;i++){
		int bx = x/(i+1)+1;
		if(i>=bx)break;
		if((y-x)%i!=0)continue;
		int by = bx+(y-x)/i;
		if(bx<=a&&by<=b){
			report(bx,by);
			return;
		}
	}
	// more
	int bx = sqrt(x), by = sqrt(y);
	while(bx>=2&&by>=2){
		auto vx = eval(x,bx);
		auto vy = eval(y,by);
		if(bx<=a&&by<=b&&vx==vy){
			report(bx,by);
			return;
		}
		if(comp(vx,vy)){
			bx--;
		}
		else {
			by--;
		}
	}
	cout << "NO\n";
}



int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout<<fixed;
  cout.precision(20);
	int tc;
	cin >> tc;
	while(tc--)
  solve();
}