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 collections import Counter
import math
import sys
from bisect import bisect,bisect_left,bisect_right
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def mod(): return 10**9+7
 
for i in range(INT()): 
  #  n = INT()
    #s = input()
    x,y,z = MAP()
    if(x == y or y == z or z == x):
        s1 = 0
        if x == y:
            s1 = x
        else:
            s1 = z
        s2 = 1
        if s1 == x and x == y:
            s2 = z
        elif s1==y and y == z:
            s2 = x
        else:
            s2 = y
        if ((s1 == x and s1 ==y and s1 > z)  or (s1 ==y and y==z and s1>x) | (s1==z and s1==x and s1>y)):
            print("YES")
            print(s1,1,s2)
        elif s1 == s2:
            print("YES")
            print(s1,1,s1)
        else:
            print("NO")
    else:
        print("NO")