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

public class A {

    private static void solve() throws Exception {
        int N[] = new int[3];

        for (int i = 0 ; i < 3; i ++ ) {
            N[i] = fs.nextInt();
        }
        int x, y, z;
        x = N[0];
        y = N[1];
        z = N[2];

        for (int i = 0; i < 3; i ++ ) {
            for (int j = 0; j < 3 ; j ++ ) {
                for (int k = 0 ; k < 3; k ++ ) {
                    int a = N[i];
                    int b = N[j];
                    int c = N[k];
                    if (x == Math.max(a,b) && y == Math.max(a,c) && z == Math.max(b,c)) {
                        pw.println("YES");
                        pw.println(a + " " + b + " " + c);
                        return;
                    }
                }
            }
        }
        pw.println("NO");


    }

    private static Reader fs = new Reader();
    private static PrintWriter pw = new PrintWriter(System.out);
    public static void main(String[] args) throws  Exception{
        int T = fs.nextInt();
        for (int t = 0; t < T; t ++ ) {
            solve();
        }
        pw.close();
    }

    static void debug(Object... O) {
        System.out.print("DEBUG ");
        System.out.println(Arrays.deepToString(O));
    }

    static class Reader {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer("");
        String next() {
            while (!st.hasMoreTokens())
                try {
                    st=new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
        int[] readArray(int n) {
            int[] a=new int[n];
            for (int i=0; i<n; i++) a[i]=nextInt();
            return a;
        }
        long nextLong() {
            return Long.parseLong(next());
        }

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

        String nextString() {
            return next();
        }
    }

}