#include <bits/stdc++.h>
using namespace std;
using ll = long long int;

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

void solve(){
    int x, y, A, B;
    cin>>x>>y>>A>>B;

    if(x == 1 || y == 1){
        if(x == y){
            cout<<"YES\n";
            cout<<"2 2\n";
        }
        else{
            cout<<"NO\n";
        }
        return;
    }

    if(x <= A && y <= B){
        cout<<"YES\n";
        cout<<x<<" "<<y<<"\n";
        return;
    }

    A = min(A, x-1);
    B = min(B, y-1);
    int loA = 2, loB = 2;

    map<vector<int>, int> mp;

    for(int a = 2; a*a <= x && a <= A; a++){
        mp[get(x, a)] = a;
        loA = a+1;
    }

    for(int b = 2; b*b <= y && b <= B; b++){
        auto v = get(y,b);
        if(mp.count(v) > 0){
            int a = mp[v];

            cout<<"YES\n";
            cout<<a<< " " <<b<<"\n";
            return;
        }
        loB = b+1;
    }

    /// p*a+q = x, p*b+q = y

    for(int p = 1; p*p < min(x, y); p++){
        if((x-y) % p != 0){
            continue;
        }

        if(x < y){
            int del = (y-x)/p;
            /// b = a+del

            int l = max(loA, loB-del);
            int r = min(A, B-del);

            l = max(l, x/(p+1)+1);
            r = min(r, x/p);

            if(l > r) continue;

            cout<<"YES\n";
            cout<<l<<" "<<l+del<<"\n";
        }
        else{
            int del = (x-y)/p;
            /// b+del = a

            int l = max(loB, loA-del);
            int r = min(B, A-del);

            l = max(l, y/(p+1)+1);
            r = min(r, y/p);

            if(l > r) continue;

            cout<<"YES\n";
            cout<<l+del<<" "<<l<<"\n";
        }
    }

    cout<<"NO\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int tc;
    cin>>tc;

    for(int cs = 1; cs <= tc; cs++){
        solve();
    }

    return 0;
}

/*
6
1 1 1000 1000
1 2 1000 1000
3 11 1000 1000
157 291 5 6
157 291 3 6
10126 114514 789 12345
*/