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.StringTokenizer;

public class A {

    int INF = (int) 1e9 + 5; // "Бесконечность"

    public static void main(String[] args) throws IOException {
        new A().run();
    }

    private void run() throws IOException {
        Reader in = new Reader();
        PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));

        solve(in, pw);
        pw.close();
    }

    class Pair {
        int x, y;

        Pair(int x, int y) {
            this.x = x;
            this.y = y;
        }

        int x() {
            return x;
        }
    }

    static class Reader {
        BufferedReader br;
        StringTokenizer st;

        Reader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        Reader(String fileName) throws FileNotFoundException {
            br = new BufferedReader(new FileReader(fileName));
        }

        String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        String nextLine() throws IOException {
            return br.readLine();
        }

        int nextInt() throws IOException {
            return Integer.parseInt(next());
        }

        long nextLong() throws IOException {
            return Long.parseLong(next());
        }

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

    private void solve(Reader in, PrintWriter out) throws IOException {
        int t = in.nextInt();
        while(t-- > 0){
            int x = in.nextInt();
            int y = in.nextInt();
            int z = in.nextInt();

            boolean f = false;
            for (int a : new int[]{x, y}){
                for(int b : new int[]{x,z}){
                    for(int c : new int[]{y,z}){

                        if(x == Math.max(a,b) && y == Math.max(a,c) && z == Math.max(b,c)){
                            out.println("YES");
                            out.println(a+" "+b +" "+c);
                            f = true;
                            break;
                        }

                    }
                    if(f) break;
                }
                if(f) break;
            }

            if(!f) out.println("NO");
        }
    }
}