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:
rr = input
rri = lambda: int(rr())
rrm = lambda: list(map(int, rr().split()))

def solve(a, b, c):
    check = set([a,b,c])
    if len(check) == 3:
        return []
    elif len(check) == 1:
        return [a]*3
    else:
        big = max(check)
        small = min(check)
        ind = [i for i in range(3) if [a, b, c][i] == big]
        if len(ind) == 1:
            return []
        ans = [1]*3
        if ind == [0,1]:
            ans[0] = big
            ans[1] = small
        elif ind == [0,2]:
            ans[1] = big
            ans[0] = small
        else:
            ans[2] = big
            ans[0] = small
    return ans
        
        
        
    

T = rri()
for i in range(1, T + 1):
    a, b, c = rrm()
    ans = solve(a, b, c)
    if ans == []:
        print('NO')
    else:
        print('YES')
        print('{} {} {}'.format(ans[0], ans[1], ans[2]))