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:
def factor(n):
    f = {}
    while n%2 == 0:
        f[2] = f.get(2, 0)+1
        n /= 2
    d = 3
    while d*d <= n:
        while n%d == 0:
            f[d]= f.get(d, 0)+1
            n /= d
        d += 2
    if n > 1:
        f[n] = f.get(n, 0)+1
    return f
def even(n):
    if(n%2==0):
        return True
    return False
def gcd(a, b):
    small = 0
    gcd = 0
    i = 1
    if(a>b):
        small = b
    else:
        small = a
    while i<small:
        if(a%i==0 and b%i==0):
            gcd = i
        i+=1
    return gcd
n = int(input())

for i in range(0, n):
    x = list(map(int, input().split()))
    x.sort()
    if(x[2]!=x[1]):
        print("NO")
        continue
    print("YES")
    a = min(x[2], x[1])
    b = min(x[1], x[0])
    c = min(x[2], x[0])
    print(a, b, c)