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

Solution:
 
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Collections;

public class A {

	public static void main(String []args) throws Exception
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		 
		String input;
		String []splited;
		int q,n,m,t;
		int []arr,arr1; 
		input=br.readLine();
		splited=input.split(" ");
		t=Integer.parseInt(splited[0]);
		long a,b,c,d;
		  int a1,b1,c1,d1;long x,y,z;
		 int u,v,k;
		 int yy=0;
		 for(int i=0;i<t;i++)
		 {
			input=br.readLine();
			splited=input.split(" ");
			x=Integer.parseInt(splited[0]);
			y=Integer.parseInt(splited[1]);
			z=Integer.parseInt(splited[2]);
			int []ar= {(int)x,(int)y,(int)z};
			Arrays.sort(ar);
			if(ar[1]==ar[2])
			{
				a1=ar[2];b1=ar[0];c1=ar[0]; 
				System.out.println("YES");
				System.out.println(a1+" "+b1+" "+c1);
			}
			else
				System.out.println("NO");
			
			
		 }
	}
	
	
}