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:
"""
Yesterday is history, tomorrow is a mystery, today is a gift of God,
which is why we call it the present.” ― Bill Keane
"""
import sys
import math
from collections import defaultdict
fi=sys.stdin.readline
fii=lambda:int(fi())
fis=lambda:fi()
fil=lambda:[int(x) for x in fi().split(' ')]
fif=lambda:float(fi())

def go(i, j, k, a, b, c, d):
    x=d['x'][i]
    y=d['y'][j]
    z=d['z'][k]
    if max(x, y) == a and max(x, z) == b and max(y, z) == c:
        return True
    return False

def solve():
    a, b, c = fil()
    d = defaultdict(list)
    d['x']=[a, b]
    d['y']=[a, c]
    d['z']=[b, c]
    flag=False
    for i in range(2):
        if flag: break
        for j in range(2):
            if flag: break
            for k in range(2):
                res=go(i,j,k,a,b,c,d)
                if res:
                    flag=True
                    print("YES")
                    print(d['x'][i], d['y'][j], d['z'][k])
                    break
    if not flag:
        print("NO")
t=fii()
for _ in range(t):
    solve()