#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
bool sortFunction(string a, string b) {
  long long l1 = a.size(), l2 = b.size();
  if (l1 == l2) return (a < b);
  return l1 < l2;
}
unsigned long long power(unsigned long long x, unsigned long long y) {
  unsigned long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (ans * x);
    y >>= 1;
    x = (x * x);
  }
  return ans;
}
double nthRoot(int A, int N) {
  double pre = rand() % 10, eps = 1e-3;
  double del = INT_MAX;
  double xK;
  while (del > eps) {
    xK = ((N - 1.0) * pre + (double)A / pow(pre, N - 1)) / (double)N;
    del = abs(xK - pre);
    pre = xK;
  }
  return xK;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    long long a[3];
    for (long long i = 0; i < 3; i++) cin >> a[i];
    long long ct = count(a, a + 3, (*max_element(a, a + 3)));
    if (ct < 2)
      cout << "NO"
           << "\n";
    else {
      cout << "YES"
           << "\n";
      cout << *max_element(a, a + 3) << " " << *min_element(a, a + 3) << " "
           << "1"
           << "\n";
    }
  }
}
