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:
#!/usr/bin/env python
# coding: utf-8

# In[1]:


a=int(input())
for i in range(a):
    user_input = input().split()
    #strip is used to remove the white space. Not mandatory
    all_numbers = [int(x.strip()) for x in user_input]


    x=all_numbers[0]
    y=all_numbers[1]
    z=all_numbers[2]
    if (x>y and x>z) or (y>z and y>x) or (z>y and x<z) or (x>y and y>z) or (x<y and x>z) or (z>x and x>y):
        print('NO')
    else:
        print('YES')
        if x==y:
            a=x
            c=z
            b=z
        elif x==y and y==z:
            a,b,c=x
        elif y==z:
            b=x
            a=x
            c=y
        elif x==z:
            a=x
            c=y
            b=y
        print(a,b,c)


# In[ ]: