Problem: You are given three positive (i.e. strictly greater than zero) integers x, y and z.

Your task is to find positive integers a, b and c such that x = max(a, b), y = max(a, c) and z = max(b, c), or determine that it is impossible to find such a, b and c.

You have to answer t independent test cases. Print required a, b and c in any (arbitrary) order.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 2 ⋅ 10^4) — the number of test cases. Then t test cases follow.

The only line of the test case contains three integers x, y, and z (1 ≤ x, y, z ≤ 10^9).

Output

For each test case, print the answer:

  * "NO" in the only line of the output if a solution doesn't exist; 
  * or "YES" in the first line and any valid triple of positive integers a, b and c (1 ≤ a, b, c ≤ 10^9) in the second line. You can print a, b and c in any order. 

Example

Input


5
3 2 3
100 100 100
50 49 49
10 30 20
1 1000000000 1000000000


Output


YES
3 2 1
YES
100 100 100
NO
NO
YES
1 1 1000000000

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
int main() {
  long long int t;
  cin >> t;
  while (t--) {
    long long int ar[4];
    set<long long int> s;
    long long int mx = -1;
    for (long long int i = 1; i <= 3; i++) {
      cin >> ar[i];
      s.insert(ar[i]);
      mx = max(ar[i], mx);
    }
    if ((long long int)s.size() == 3) {
      cout << "NO"
           << "\n";
    } else if ((long long int)s.size() == 2) {
      long long int f = 1;
      sort(ar + 1, ar + 4);
      for (long long int i = 2; i <= 3; i++) {
        if (ar[i] == ar[i - 1]) {
          if (ar[i] != mx) f = 0;
        }
      }
      if (f) {
        cout << "YES"
             << "\n";
        for (long long int i : s) cout << i << ' ';
        cout << 1 << "\n";
      } else {
        cout << "NO"
             << "\n";
      }
    } else {
      cout << "YES"
           << "\n";
      for (long long int i = 1; i <= 3; i++) {
        cout << ar[i] << ' ';
      }
      cout << "\n";
    }
  }
}