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 long long mod = 1e9 + 7;
const long long modx = 998244353;
const long long Nx = 1e5 + 2;
const long long inf = (long long)(1e19 + 10LL);
void solve() {
  long long arr[3];
  cin >> arr[0];
  cin >> arr[1];
  cin >> arr[2];
  sort(arr, arr + 3);
  long long b = arr[0];
  long long c = arr[2];
  long long a = 1;
  if (max(a, b) == arr[0] && max(b, c) == arr[1] && max(a, c) == arr[2]) {
    cout << "YES" << endl;
    cout << a << " " << b << " " << c << endl;
    return;
  }
  cout << "NO" << endl;
}
signed main() {
  long long test = 1;
  cin >> test;
  while (test--) {
    solve();
  }
  return 0;
}