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:
if __name__ == '__main__':
	t = int(input())

	for _ in range(t):
		x, y, z = map(int,input().split())
		a = 0
		b = 0
		c = 0
		f = 0
		if x == y and z < x:
			a = x
			b = z
			c = b
			f = 1
		if y == z and y > x:
			c = y
			a = x
			b = a
			f = 1
		if x == z and x > y:
			b = x
			a = y
			c = a
			f = 1
		if x!= y and ((z == x and z > y) or (z == y and z > x)):
			b = x
			c = y
			if z == x:
				a = y
			else:
				a = x
			f = 1
		if x == y == z:
			a = x
			b = x
			c = x
			f = 1

		if f == 0:
			print('NO')
		else:
			print('YES')
			print(str(a)+ " " + str(b) + " " + str(c))