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 int MOD = 1e9 + 7;
const int nax = 1e6 + 10;
long long int i, j, x, y, k, f, z, cnt;
long long int p = 0;
int main() {
  long long int t = 1;
  cin >> t;
  while (t--) {
    long long int x, y, z;
    cin >> x >> y >> z;
    long long int a[2], b[2], c[2];
    a[0] = x;
    a[1] = z;
    b[0] = x;
    b[1] = y;
    c[0] = y;
    c[1] = z;
    long long int p = 0;
    for (i = 0; i < 2; i++) {
      for (j = 0; j < 2; j++) {
        for (k = 0; k < 2; k++) {
          if (x == max(a[i], b[j]) && y == max(b[j], c[k]) &&
              z == max(a[i], c[k])) {
            cout << "YES" << endl;
            cout << a[i] << " " << b[j] << " " << c[k] << endl;
            p = 1;
            break;
          }
        }
        if (p == 1) break;
      }
      if (p == 1) break;
    }
    if (p == 0) cout << "NO" << endl;
  }
}