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.io.*;
import java.io.BufferedReader; 
import java.io.IOException; 
import java.io.InputStreamReader; 
import java.util.StringTokenizer; 
import java.io.File;  
import java.io.PrintWriter;
import java.util.Arrays;
  
public class Main 
{ 
    public static void main(String[] args) 
    { 
        FastReader sc=new FastReader(); 
        int t = sc.nextInt(); 
        while (t-- > 0) 
		{ 
			int x= sc.nextInt();
			int y = sc.nextInt();
			int z = sc.nextInt();
			int max=Math.max(x,Math.max(y,z));
			int c=0;
			if(max==x)
			c++;
			if(max==y)
			c++;
			if(max==z)
			c++;
			if(c==1){
			System.out.println("NO");
			continue;
			}
			if(c==2){
			    System.out.println("YES");
			    if(x<max){
			        System.out.print(x+" "+ (x)+" ");
			    }
			    else if(y<max){
			        System.out.print(y+" "+ (y)+" ");
			    }
			    else if(z<max){
			        System.out.print(z+" "+ (z)+" ");
			    }
			    System.out.print(max);
			    System.out.println();
			}
			if(c==3){
			    System.out.println("YES");
			    System.out.println(max+" "+max+" "+max);
			}
			
			
		} 
         
        
    } 
    static void shuffleArray(int[] arr){
        int n = arr.length;
        Random rnd = new Random();
        for(int i=0; i<n; ++i){
            int tmp = arr[i];
            int randomPos = i + rnd.nextInt(n-i);
            arr[i] = arr[randomPos];
            arr[randomPos] = tmp;
        }   
}
    static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    } 
}