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:
n = int(input())
T=[]
while(n>0):
  n -= 1
  T = list(map(int, input().split()))
  T_set = set(T)
  T_set_list = list(T_set)
  if(len(T_set_list)==2):
    B=0
    for i in T:
      if(i == max(T)):
        B += 1
    if(B == 1):
      print("NO")
      continue
  elif(len(T_set_list)==3):
    print("NO")
    continue
  print("YES")
  if(T[0]==min(T)):
    print(T[0], T[0], max(T))
  elif(T[1]==min(T)):
    print(T[1], max(T), T[1])
  elif(T[2]==min(T)):
    print(max(T), T[2], T[2])