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.awt.Point;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.StringTokenizer;
import java.util.*;
import java.io.*;
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author User
 */
public class C
{
    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;
        }
    }
   
    static FastReader fs;

    static void in(int a[]) {
        for (int i = 0; i < a.length; i++) {
            a[i] = fs.nextInt();
        }
    }

    static void in(long a[]) {
        for (int i = 0; i < a.length; i++) {
            a[i] = fs.nextLong();
        }
    }

    static void in(int a[][]) {
        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < a[0].length; j++) {
                a[i][j] = fs.nextInt();
            }
        }
    }

    static void sort(int a[]) {
        Arrays.sort(a);
    }

    static void sort(long a[]) {
        Arrays.sort(a);
    }

    static void sort(String a[]) {
        Arrays.sort(a);
    }
    static long diffSum(ArrayList<Long> al,int pos){
        long sum=0,v=al.get(pos);
        for(Long i:al)
            sum+=Math.abs(i-v);
        return sum;
    }
   
    static long count(ArrayList<Long> al){
        if(al.size()%2==0)
            return Math.max(diffSum(al,al.size()/2-1),diffSum(al,al.size()/2));
        else
            return diffSum(al,al.size()/2);
    }
   
   
    public static void main(String[] args) 
    {
        fs = new FastReader();
                int t;
                
                t=fs.nextInt();
                while(t-->0)
                {
                    int x,y,z;
                    x=fs.nextInt();
                      y=fs.nextInt();
                        z=fs.nextInt();
                 
                   int m=Math.max(x,(Math.max(y,z)));
                   
                  if(!((m==x && m==y)||(m==x && m==z)||(m==y && m==z)))
                    System.out.println("NO");
                    else
                    {
                        System.out.println("YES");
                        
                        if(x==y && y==z)
                        System.out.println(x+ " " + x +" " +x);
                          else
                        if(x==y && y!=z)
                        System.out.println(x+ " " + z +" " +z);
                        else
                        if(x==z && y!=z)
                        System.out.println(y+ " " + z +" " +y);
                        else
                        if(z==y && x!=z)
                        System.out.println(x+ " " + x +" " +z);
                    }

                       
                     }
                }
    }