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 PYTHON):

Solution:
def check(a, b, c, data):
    if max(a, b) == data[0] and max(a, c) == data[1] and max(b, c) == data[2]:
        return 1
    return 0


def Main():
    n = int(raw_input().strip())
    for i in xrange(n):
        lstAnswer = []
        data = map(int, raw_input().strip().split())
        for a in data:
            for b in data:
                tempc = data[-1]
                lstc = range(a - 1, a + 2) + range(b - 1, b + 2) + range(tempc - 1, tempc + 2)
                for c in lstc:
                    if c <= 0:
                        continue
                    if check(a, b, c, data):
                        lstAnswer = [a, b, c]
                        break
        if lstAnswer:
            print "YES"
            print lstAnswer[0], lstAnswer[1], lstAnswer[2]
        else:
            print "NO"


Main()