#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

void print(int a, int b, bool is_swap) {
    if (is_swap) swap(a, b);
    cout << a << " " << b << "\n";
}

vector<int> get(int x, int b) {
    vector<int> ans;
    while (x) {
        ans.push_back(x % b);
        x /= b;
    }
    return ans;
}

void solve() {
    int x, y, A, B;
    cin >> x >> y >> A >> B;
    if (x == y) {
        cout << "YES\n2 2\n";
        return;
    }
    bool is_swap = false;
    if (x > y) {
        swap(x, y);
        swap(A, B);
        is_swap = true;
    }
    for (int p = 1; p * p <= y - x; ++p) {
        if ((y - x) % p != 0) continue;
        int q = x % p;
        int a = x / p;
        int b = y / p;
        if (p < a && q < a && a <= A && b <= B && a >= 2) {
            cout << "YES\n";
            print(a, b, is_swap);
            return;
        }
        p = (y - x) / p;
        q = x % p;
        a = x / p;
        b = y / p;
        if (p < a && q < a && a <= A && b <= B && a >= 2) {
            cout << "YES\n";
            print(a, b, is_swap);
            return;
        } 
        p = (y - x) / p;
    }
    vector<pair<vector<int>, int>> varx;
    for (int a = 2; a * a <= x && a <= A; ++a) {
        varx.emplace_back(get(x, a), a);
    }
    vector<pair<vector<int>, int>> vary;
    for (int b = 2; b * b <= y && b <= B; ++b) {
        vary.emplace_back(get(y, b), b);
    }
    sort(varx.begin(), varx.end());
    sort(vary.begin(), vary.end());
    int id = 0;
    for (auto elem : varx) {
        while (id + 1 < (int)vary.size() && vary[id].first < elem.first) ++id;
        if (vary[id].first == elem.first) {
            int a = elem.second, b = vary[id].second;
            cout << "YES\n";
            print(a, b, is_swap);
            return;
        }
    }
    cout << "NO\n";
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int tst;
    cin >> tst;
    while (tst--) {
        solve();
    }

    return 0;
}