#include<bits/stdc++.h>
# define ull unsigned long long
# define int long long
# define rep(i, j, k) for (int i = j; i <= k; ++i)
# define B 998244853ull
using namespace std;

int T, x, y, a, b, rev;
map < ull, int > mp, cp; 

signed main()
{
	ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
	cin >> T;
	while (T--)
	{
	//	cout << endl;
		mp = cp;
		cin >> x >> y >> a >> b;
		if (x == y) {cout << "YES\n2 2\n"; continue;}
		bool ok = false;
		int i = 2, j = 2;
		for (; i <= a && i * i <= x; ++i)
		{
//			cout << i << endl;
			int t = x;
			ull hashe = 0;
			while (t) hashe = B * hashe + t % i, t /= i;
			mp[hashe] = i;
		}
		for (; j <= b && j * j <= y; ++j)
		{
//			cout << j << endl; 
			int t = y;
			ull hashe = 0;
			while (t) hashe = B * hashe + t % j, t /= j;
			if (mp[hashe]) {cout << "YES\n" << mp[hashe] << ' ' << j << '\n'; ok = true; break;}
		}
		if (ok) continue;
	//	cout << "OK\n";
		if (y < x) swap(x, y), swap(a, b), rev = 1; else rev = 0;
		int cha = y - x;
		for (i = 1; i * i < cha; ++i) if (cha % i == 0)
		{
			int c = cha / i, bst = min(min(a, b - c), x / i);
			if (bst >= 2 && bst * bst > x && (bst + c) * (bst + c) > y && x / bst == y / (bst + c) && x % bst == y % (bst + c))
			{
				cout << "YES\n";
				if (rev) cout << bst + c << ' ' << bst << '\n'; else cout << bst << ' ' << bst + c << '\n'; 
				ok = true; break;
			}
		}
		if (!ok) cout << "NO\n";
	}
	return 0;
}