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 PYTHON):

Solution:
FAST_IO = 0
if FAST_IO:
    import io, sys, atexit
    rr = iter(sys.stdin.read().splitlines()).next
    sys.stdout = _OUTPUT_BUFFER = io.BytesIO()
    @atexit.register
    def write():
        sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
else:
    rr = raw_input
rri = lambda: int(rr())
rrm = lambda: map(int, rr().split())
####
 
# from collections import defaultdict as ddic, Counter, deque
# from itertools import product, combinations, permutations
# import heapq
# import math
# YES, NO, IMP = "YES", "NO", "IMPOSSIBLE"
# MOD = 10**9 + 7
 
####
def solve(a):
	a.sort()
	x = a[0]
	y = a[1]
	z = a[2]
	if x < y < z:
		print "NO"
	else:
		if x==y and y==z:
			print "YES"
			print x,y,z
		elif x==y:
			print "NO"
		else:
			print "YES"
			print z,x,"1"

T = rri()
for t in xrange(1, T+1):
	a= rrm()
	solve(a)