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;
int main(void) {
  int t, i, j, x, y, z, g1, g2;
  cin >> t;
  while (t--) {
    cin >> x >> y >> z;
    set<int> s;
    s.insert(x);
    int m1, m2;
    m1 = s.size();
    s.insert(y);
    m2 = s.size();
    if (m1 == m2) g1 = y;
    s.insert(z);
    m1 = s.size();
    if (m1 == m2) g1 = z;
    if (x != g1) {
      g2 = x;
    }
    if (y != g1) {
      g2 = y;
    }
    if (z != g1) {
      g2 = z;
    }
    if (s.size() < 3) {
      if (s.size() == 1) {
        cout << "YES\n";
        cout << x << " " << x << " " << x;
      }
      if (s.size() == 2) {
        if (g1 > g2) {
          cout << "YES\n";
          cout << g1 << " " << g2 << " " << g2;
        } else {
          cout << "NO";
        }
      }
    } else {
      cout << "NO";
    }
    cout << "\n";
  }
  return 0;
}