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;
void solve();
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
  return 0;
}
void solve() {
  int T;
  cin >> T;
  while (T-- > 0) {
    int x, y, z;
    cin >> x >> y >> z;
    int _A[] = {x, y};
    int _B[] = {x, z};
    int _C[] = {y, z};
    bool flag = false;
    int a, b, c;
    for (int i = 0; i < 2; i++) {
      a = _A[i];
      for (int j = 0; j < 2; j++) {
        b = _B[j];
        for (int k = 0; k < 2; k++) {
          c = _C[k];
          if (x == max(a, b) && y == max(a, c) && z == max(b, c)) {
            flag = true;
            break;
          }
        }
        if (flag) break;
      }
      if (flag) break;
    }
    if (flag) {
      cout << "Yes\n";
      cout << a << " " << b << " " << c << "\n";
    } else
      cout << "No\n";
  }
}