#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int bas = 1333331;
int T;
map<int, int> mp;
pair<int, int> pii;
bool check(int l1, int r1, int l2, int r2, int d)
{
    // cout<<l1<<' '<<r1<<' '<<l2<<' '<<r2<<endl;
    if (l1 % d != l2 % d)
        return false;
    if (r1 < l2 || l1 > r2)
        return false;
    if (l2 <= l1 && l1 <= r2)
    {
        pii = {0, (l1 - l2) / d};
        return true;
    }
    if (l2 <= r1 && r1 <= r2)
    {
        pii = {(r1 - l1) / d, (r1 - l2) / d};
        return true;
    }
    if (l1 <= l2 && l2 <= r1)
    {
        pii = {(l2 - l1) / d, 0};
        return true;
    }
    if (l1 <= r2 && r2 <= r1)
    {
        pii = {(r2 - l1) / d, (r2 - l2) / d};
        return true;
    }
    return false;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> T;
    while (T--)
    {
        mp.clear();
        int x, y, A, B, flg = 0;
        cin >> x >> y >> A >> B;
        int lim = sqrt(max(x, y));
        for (int i = 2; i <= min(lim + 1, A); i++)
        {
            int cur = 0, t = x;
            vector<int> num;
            while (t)
            {
                num.push_back(t % i);
                t = t / i;
            }
            reverse(num.begin(), num.end());
            for (auto cc : num)
                cur = (cur * 1LL * bas + cc) % mod;
            mp[cur] = i;
        }
        for (int i = 2; i <= min(lim + 1, B); i++)
        {
            int cur = 0, t = y;
            vector<int> num;
            while (t)
            {
                num.push_back(t % i);
                t = t / i;
            }
            reverse(num.begin(), num.end());
            for (auto cc : num)
                cur = (cur * 1LL * bas + cc) % mod;
            if (mp[cur])
            {
                cout << "YES\n";
                cout << mp[cur] << ' ' << i << '\n';
                flg = 1;
                break;
            }
        }
        if (flg)
            continue;
        if (x == y && A > x && B > y)
        {
            cout << "YES\n";
            cout << x + 1 << ' ' << y + 1 << '\n';
            continue;
        }
        A = min(x, A);
        B = min(y, B);
        // cout << A << ' ' << B << endl;
        int tt=max(x/A,y/B);
        for (int l1 = min(x/tt,A), l2 = min(y/tt, B), r1, r2; l1 >= 1 && l2 >= 1; l1 = r1 - 1, l2 = r2 - 1)
        {
            if (x / l1 >= l1)
                break;
            if (y / l2 >= l2)
                break;
            r1 = x / (x / l1 + 1) + 1;
            r2 = y / (y / l2 + 1) + 1;
            // cout << x / l1<<' '<<y/l2 << endl;
            // cout<<l1<<' '<<l2<<endl;
            if (check(x % l1, x % r1, y % l2, y % r2, x / l1))
            {
                cout << "YES\n";
                cout << l1 - pii.first << ' ' << l2 - pii.second << '\n';
                flg = 1;
                break;
            }
        }
        if (!flg)
            cout << "NO\n";
    }
}