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:
t=int(input())
final=[]
for i in range(t):
    k={0:"c",1:"a",2:"b"}
    l=[int(x) for x in input().split()]
    if(max(l[0],l[1])==max(l[1],l[2])==max(l[0],l[2])):
        final.append("YES")
        a=l.copy()
        a.sort()
        first=[]
        for i in range(3):
            first.append([l[l.index(a[0])],l.index(a[0])+i])
            l.remove(l[l.index(a[0])])
            a.remove(a[0])
        if(first[0][0]==first[1][0] and first[1][0]==first[2][0]):
            final.append([first[0][0],first[0][0],first[0][0]])
        else:
            final.append([first[0][0],first[1][0],1])   
    else:
        final.append("NO")        
i=0
while(i!=len(final)):
    print(final[i])
    if(final[i]=="YES"):
        print(*final[i+1])
        i+=2
    else:
        i+=1