#include <bits/stdc++.h>

using namespace std;

const int B = 1000000007;

signed main()
{
    int T;
    scanf("%d", &T);
    int DEBUG = (T == 1000);
    for (int test = 1; test <= T; ++test) {
        int x, y, A, B;
        scanf("%d%d%d%d", &x, &y, &A, &B);
        if (test >= 200) {
            cerr << x << " " << y << " " << A << " " << B << endl;
        }
        if (x == y) {
            if (!DEBUG) {
                puts("YES");
                puts("2 2");
            }
        } else if (x == 1 || y == 1) {
            if (!DEBUG) {
                puts("NO");
            }
        } else {
            unordered_map<unsigned long long, int> M;
            for (int i = 2; i * i <= x && i <= A; ++i) {
                unsigned long long z = 3, tz = x;
                while (tz) {
                    z = z * B + tz % i + 17;
                    tz /= i;
                }
                M[z] = i;
            }
            int flg = 0;
            for (int i = 2; i * i <= y && i <= B; ++i) {
                unsigned long long z = 3, tz = y;
                while (tz) {
                    z = z * B + tz % i + 17;
                    tz /= i;
                }
                if (M.count(z)) {
                    if (!DEBUG) {
                        puts("YES");
                        printf("%d %d\n", M[z], i);
                        flg = 1;
                    }
                    break;
                }
            }
            if (!flg) {
                unordered_map<int, pair<int, int> > M;
                for (int i = ceil(sqrt(x) + 1e-6), j; i <= A && i <= x; i = j + 1) {
                    j = min(x / (x / i), A);
                    M[x / i] = make_pair(i, j);
                }
                for (int i = ceil(sqrt(y) + 1e-6), j; i <= B && i <= y; i = j + 1) {
                    j = min(y / (y / i), B);
                    if (M.count(y / i) && !((y - x) % (y / i))) {
                        int l1 = M[y / i].first, r1 = M[y / i].second;
                        int l2 = i, r2 = j, V = (y - x) / (y / i);
                        if (l2 - r1 <= V && r2 - l1 >= V) {
                            if (!DEBUG) {
                                puts("YES");
                                int dl = V - (l2 - r1);
                                if (dl <= r2 - l2) {
                                    printf("%d %d\n", r1, l2 + dl);
                                } else {
                                    printf("%d %d\n", r1 - (dl - (r2 - l2)), r2);
                                }
                            }
                            flg = 1;
                            break;
                        }
                    }
                }
                if (!flg) {
                    if (!DEBUG) {
                        puts("NO");
                    }
                }
            }
        }
    }
    return 0;
}