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:
#x,y,z can't be diffrent or atleast two should be same
#all three can be same -> a=b=c=x=y=z
#if y and z are same then x should be less than both of them -> y=z=c
#if x and y are same then z should be less than both
# if x and z are same then y should be less than both
if __name__ == '__main__':
    t = int(input())
    for _ in range(t):
        x,y,z = map(int,input().split())
        if x == y and y == z:
            print('YES')
            print(x,x,x,sep=' ')
            continue
        elif x==y and z<x :
            a=x
            b=z
            print('YES')
            print(a, b, b, sep=' ')
        elif x==z and y<x :
            b=x
            a=y
            print('YES')
            print(a, b, a, sep=' ')
        elif z==y and x<z :
            c=z
            a=x
            print('YES')
            print(a, a, c, sep=' ')
        else:
            print('NO')