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.util.*;
import java.lang.*;
import java.io.*;

public class a3
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc=new Scanner(System.in);
		int tt=sc.nextInt();
		while(tt-->0){
		   int a=sc.nextInt();
		   int b=sc.nextInt();
		   int c=sc.nextInt();
		   int min=Math.min(a,Math.min(b,c));
		   int max=Math.max(a,Math.max(b,c));
		   Set<Integer> hs=new HashSet<>();
		   hs.add(a);
		   hs.add(b);
		   hs.add(c);
		   if(hs.size()==3){
		       System.out.println("NO");
		       continue;
		   }
		   if(hs.size()==1){
		       System.out.println("YES");
		       System.out.println(a+" "+a+" "+a);
		       continue;
		   }
		   Map<Integer,Integer> hm=new HashMap<>();
		   hm.put(a,hm.getOrDefault(a,0)+1);
		   hm.put(b,hm.getOrDefault(b,0)+1);
		   hm.put(c,hm.getOrDefault(c,0)+1);
		   int aa=-1;
		   for(Map.Entry<Integer,Integer> e:hm.entrySet()){
		       int kk=e.getKey();
		       int vv=e.getValue();
		       if(vv==2){
		           aa=kk;
		       }
		       
		   }
		   if(aa==max){
		       System.out.println("YES");
		       System.out.println(min+" "+min+" "+max);
		       continue;
		   }
		   else{
		       	       System.out.println("NO");
		       continue;
		       
		   }
		   
		   
		    
		}
	}
}