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 PYTHON3):

Solution:
def ok(x, y, z, a):
    x1, y1, z1 = max(a[0], a[1]), max(a[0], a[2]), max(a[1], a[2])
    if x == x1 and y == y1 and z == z1:
        return True
    else:
        return False

tests = int(input())
for test in range(tests):
    x, y, z = map(int, input().split())
    f = False
    a1 = [x, y, z]
    a2 = [x, z, y]
    a3 = [y, x, z]
    a4 = [y, z, x]
    a5 = [z, x, y]
    a6 = [z, y, x]
    b = [[x, x, x], [x, x, y], [x, x, z],
         [x, y, x], [x, y, y], [x, y, z],
         [x, z, x], [x, z, y], [x, z, z],
         [y, x, x], [y, x, y], [y, x, z],
         [y, y, x], [y, y, y], [y, y, z],
         [y, z, x], [y, z, y], [y, z, z],
         [z, x, x], [z, x, y], [z, x, z],
         [z, y, x], [z, y, y], [z, y, z],
         [z, z, x], [z, z, y], [z, z, z]]
    for i in b:
        if ok(x, y, z, i):
            print('YES')
            print(i[0], i[1], i[2])
            f = True
            break
    if not f:
        print('NO')