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:
import sys
import math
from  collections import defaultdict

# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')

def solve(test):
	x, y, z = map(int, input().split())
	if x != y and y != z and x != z:
		print('NO')
	else:
		mx = max(x, y, z)
		mn = min(x, y, z)
		a = [x, y, z]
		cntmx, cntmn = 0, 0
		for e in a:
			if e == mx:
				cntmx += 1
			elif e == mn:
				cntmn += 1

		if cntmx == 3:
			print('YES')
			print(x, y, z)
		elif cntmn == 2 and cntmx == 1:
			print('NO')
		elif cntmn == 1 and cntmx == 2:
			print('YES')
			if mx == x and mx == y:
				print(mx, mn, mn)
			elif mx == x and mx == z:
				print(mn, mx, mn)
			elif mx == y and mx == z:
				print(mn, mn, mx)



if __name__ == "__main__":
	test_cases = int(input())
	for t in range(1, test_cases + 1):
		solve(t)