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:
#headers
import sys
import os
from collections import Counter, deque, defaultdict
import itertools
import math
import io
 
#inputs
def ii():return int(input())
def li():return list(map(int,input().split()))
def mi():return map(int,input().split())

#fns
def gcd(x, y): # math.gcd is slower
    """ returns greatest common divisor of x and y """
    while y:
        x, y = y, x % y
    return x
 
def check_sorted(a):
    ''' returns True/False '''
    for i in range(len(a)-1):
        if a[i]>a[i+1]:
            return False
    return True

def divs(n, start=1):
    """ returns a list of all divisors till n """
    divisors = []
    #rdivisors=[]
    for i in range(start, int(math.sqrt(n) + 1)):
        if n % i == 0:
            if n / i == i:
                divisors.append(i)
            else:
                divisors.extend([i, n // i])
    return divisors

############# MAIN CODE ###############################################################

def main():
    for i in range(ii()):
        x,y,z=mi()
        #a,b  a,c b,c
        if x==y and y==z:
            print("YES")
            print(x,y,z)
            continue
        if (x!=y and y!=z and x!=z ) or (x>y and x>z) or (y>x and y>z) or (z>x and z>y):
            print("NO")
            continue
        a=max(x,y,z)
        b=min(x,y,z)
        c=b
        print("YES")
        print(a,b,c)
        
        






#######################################################################################
if __name__ == "__main__":
    main()