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

//author : s a n 1 d h y a

//Date : 17-07-2020 

public class A656 {
    static long Mod = 1000000007;

    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 ni() {
            return Integer.parseInt(next());
        }

        long nl() {
            return Long.parseLong(next());
        }

        double nd() {
            return Double.parseDouble(next());
        }

        String nln() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }


    public static void sortbyColumn(int arr[][], int col) {
        Arrays.sort(arr, new Comparator<int[]>() {

            @Override
            public int compare(final int[] entry1, final int[] entry2) {

                if (entry1[col] > entry2[col])
                    return 1;
                else
                    return -1;
            }
        });
    }

    public static long modex(long x, long y) {
        x = x % Mod;
        long ret = 1;
        while (y > 0) {
            if (y % 2 != 0) {
                ret = ret * x % Mod;
            }
            x = x * x % Mod;
            y >>= 1;
        }
        return ret;
    }

    public static long mplr(long x, long y) {
        long ret = 0;
        while (y != 0) {
            if (y % 2 != 0) {
                ret = (ret + x) % Mod;
            }
            x = (x + x) % Mod;
            y >>= 1;
        }
        return ret;
    }

    public static void main(String[] args) {
        FastReader sc = new FastReader();
        int t = sc.ni();
        while (t-- > 0) {
        long x=sc.nl();
        long y=sc.nl();
        long z=sc.nl();
        long m=Math.max(x,y);
        long m2=Math.max(m,z);
        long m3=Math.min(x,y);
        long m4=Math.min(m3,z);
        int c=0;
        if(x==m2)
            c++;
        if(y==m2)
            c++;
        if(z==m2)
            c++;

        if(c==3)
        {
            System.out.println("YES");
            System.out.println(x+" "+x+" "+x);
        }

        else if(c==2)
        {
            System.out.println("YES");
            System.out.println(m2+" "+m4+" "+m4);
        }

        else
        {
            System.out.println("NO");
        }

        }
    }
}