//  Nikita Golikov, 2023

#include <bits/stdc++.h>

using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;

#ifdef GOLIKOV
  #include "/Users/golikovnik/contests/debug.h"
#else
  #define debug(...) ;
#endif

template <class A, class B>
bool smin(A& x, B&& y) {
  if (y < x) {
    x = y;
    return true;
  }
  return false;
}

template <class A, class B>
bool smax(A& x, B&& y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}

void solveTest() {
  int x, y, A, B;
  cin >> x >> y >> A >> B;
  if (x == y) {
    cout << "YES\n" << 2 << ' ' << 2 << '\n';
    return;
  }
  int mB = 2;
  while (mB * mB < max(x, y)) {
    ++mB;
  }
  map<vector<int>, int> mpA;
  for (int bx = 2; bx <= A && bx < mB; ++bx) {
    vector<int> cur;
    int curX = x;
    while (curX > 0) {
      cur.push_back(curX % bx);
      curX /= bx;
    }
    mpA[cur] = bx;
  }
  for (int by = 2; by <= B && by < mB; ++by) {
    vector<int> cur;
    int curY = y;
    while (curY > 0) {
      cur.push_back(curY % by);
      curY /= by;
    }
    if (mpA.count(cur)) {
      cout << "YES\n";
      cout << mpA[cur] << ' ' << by << '\n';
      return;
    }
  }
  bool sw = false;
  if (x < y) {
    sw = true;
    swap(x, y);
    swap(A, B);
  }
  int diff = x - y;

  auto checkD = [&](int n) {
    int dab = diff / n;
    //  a - dab <= B
    //  a <= B + dab
    //  a <= A
    //  a <= x
    //  a - dab <= y
    int a = min({A, B + dab, x / n, y / n + dab, x, y + dab});
    debug(n, dab, a);
    if (a >= 2) {
      int b = a - dab;
      if (b >= 2) {
        assert(a <= A && b <= B);
        debug(x, y, a, b, mB);
        if (a * a >= x && b * b >= y && x % a == y % b && x / a == y / b) {
          cout << "YES\n";
          if (sw) {
            swap(a, b);
          }
          cout << a << ' ' << b << '\n';
          return true;
        }
      }
    }
    return false;
  };

  for (int d = 1; d * d <= diff; ++d) {
    if (diff % d == 0) {
      if (checkD(d)) return;
      if (checkD(diff / d)) return;
    }
  }
  cout << "NO\n";
}

int main() {
#ifdef GOLIKOV
  assert(freopen("in", "rt", stdin));
  auto _clock_start = chrono::high_resolution_clock::now();
#endif
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int tests_;
  cin >> tests_;
  for (int tt_ = 1; tt_ <= tests_; ++tt_) {
    solveTest();
  }

#ifdef GOLIKOV
  cerr << "Executed in " << chrono::duration_cast<chrono::milliseconds>(
      chrono::high_resolution_clock::now()
          - _clock_start).count() << "ms." << endl;
#endif
  return 0;
}