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:
for _ in range(int(input())):
    x,y,z = map(int,input().split(' '))
    pos = [[x,y],[z,x],[y,z]]
    a = []
    for i in range(2):
        for j in range(2):
            for k in range(2):
                q = pos[0][i]
                w = pos[1][j]
                e = pos[2][k]
                a.append([q,w,e])
                
    ans = 'NO'

    for item in a:
        a1 = item[0]
        b1 = item[1]
        c1 = item[2]
        if x==max(a1,b1) and y==max(a1,c1) and z==max(b1,c1):
            ans = 'YES'
            break
    if ans=='YES':
        print(ans)
        print(a1,b1,c1)
    else:
        print(ans)