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:
a = int(input())
for lmn in range(0,a):
	l = list(map(int, input().split()))
	a = l[0]
	b = l[1]
	c = l[2]
	if(a!=b and b!=c and a!=c):
		print("NO")
	else:
		# max1 = max(a,max(b,c))
		# print("uu")
		if(a==b and a<c):
			print("NO")
		elif(a==c and a<b):
			print("NO")
		elif(c==b and b<a):
			print("NO")
		else:
			max2 = max(a,max(b,c))
			x = max2
			y = 0
			if(a!=max2):
				y = a
			elif(b!=max2):
				y = b
			else:
				y = c
			if(x>1 and y>1 ):
				print("YES")
				print(x,y,1)
			else:
				print("YES")
				print(x,1,1)