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())
maxs_ar = []
for i in range(t):
    xyz = []
    x,y,z = map(int,input().split())
    xyz.append(x)
    xyz.append(y)
    xyz.append(z)

    maxs_ar.append(xyz)

def find_maximumi(maxs_ar):
    ans = []
    for maxs in maxs_ar:
        maxs_ans = []
        a,b,c = 1,1,1
        maxs.sort()
        x,y,z = maxs[0],maxs[1],maxs[2]

        if y!=z:
            maxs_ans.append("NO")
        else:
            b = x
            c = y

            if x==y:
                a = x
            maxs_ans.append("YES")
            maxs_ans.append(a)
            maxs_ans.append(b)
            maxs_ans.append(c)



        ans.append(maxs_ans)
    return ans

maxs_ans = find_maximumi(maxs_ar)
for ans in maxs_ans:
    if ans[0] == "YES":
        print("YES")
        print(ans[1],ans[2],ans[3])
    else:
        print("NO")