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:
/* package whatever; // don't place package name! */
 
import java.util.*;
import java.math.BigInteger; 
import java.lang.*;
import java.io.*;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.lang.Math; 
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
 
/* Name of the class has to be "Main" only if the class is public. */
public class bbg
{
	public static int result;
 
public static ArrayList<Integer> [] graph;
 
public static int[]cats;
 public static String[]vector;
 
 
public static int vizitat[];
public static int x;
//public static HashMap<String, Integer> map2;
 
 
	public static void main (String[] args) throws IOException {
 
Scanner input = new Scanner(System.in);
 
HashMap<Integer, Integer> contor1= new HashMap<Integer, Integer>();
HashMap<Integer, Integer> contor2= new HashMap<Integer, Integer>();


HashMap<Integer, Integer> map= new HashMap<Integer, Integer>();
HashMap<String, Integer> litere= new HashMap<String, Integer>();
HashMap<String, Integer> combinari= new HashMap<String, Integer>();


 litere.put("a",1);
 litere.put("e",1);
litere.put("i",1);
litere.put("o",1);

litere.put("u",1);
 BigInteger numar_initial; 
 BigInteger primul; 
 BigInteger doilea;
  BigInteger produs;
  BigInteger unitatea;
  
  int teste=input.nextInt();
   int min,max;
 
  for (int t=1; t<=teste;t++){
   int c=-1;
   int a=-1;
   int b=-1;
  
  
   int ab=input.nextInt();
   int ac=input.nextInt();
   int bc=input.nextInt();
   
   int y=0;
   if (ab==ac && bc<=ab) {y=1;a=ab; b=bc;c=bc;}
   if(bc==ab && ac<=bc) {y=1;b=ab;c=ac;a=ac;}
   if(ac==bc && ab<=ac) {y=1;c=ac;a=ab;b=ab;}
   
   if (y==1) {System.out.println("YES");System.out.println(a + " " + b + " "+c);}
   else System.out.println("NO");
 
  }
  
   
  
  
  
   
  
  
  
 
}

}