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:
from math import log2, ceil, floor
from collections import defaultdict, OrderedDict, Counter, deque
from heapq import heappush, heappop, heapify

def str_inp():
    return input()
def list_inp():
    return list(map(int,input().split()))
def map_inp():
    return map(int,input().split())
def int_inp():
    return int(input())
def float_int():
    return float(input())
    
def isprime(n):
    if (n <= 1) : 
        return False
    if (n <= 3) : 
        return True
    if (n % 2 == 0 or n % 3 == 0) : 
        return False
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
    return True

for _ in range(int_inp()):
    x,y,z = map_inp()
    a=sorted([x,y,z])
    if a[0]==1:
        if a[1]!=a[2]:
            print("NO")
        else:
            print("YES")
            print(1,1,a[1])
    else:
        if a[0]==a[1]==a[2]:
            print("YES")
            print(a[0],a[0],a[0])
        elif a[0]!=a[1]!=a[2] and a[0]!=a[2]:
            print("NO")
        elif a[0]==a[1] and a[1]!=a[2]:
            print("NO")
        elif a[0]!=a[1] and a[1]==a[2]:    
            print("YES")
            print(a[1],a[0],a[0]-1)
    # if x==y==z:
    #     print("YES")
    #     print(x,x,x)
    # elif x==y>=z:
    #     print("YES")
    #     print(x,x,b-1)
    # elif y==z>=x:
    #     print("YES")
    #     print(y,y,y-1)
    # elif x==z>y:
    #     print("YES")
    #     print(x,x,x-1)
    # elif x==z or y==z:
    #     print("YES")
    #     print(x,y,z)
    # else:
    #     print("NO")