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

public class Main {
    static int[] used;
    static int n;
    static ArrayList<Integer>[] list;
    static int k;
    static int z;
    static ArrayList<Integer> len;

    static void dfs(int x) {
        used[x] = 1;
        for (Integer i : list[x]) {
            if (used[i] == 0) {
                dfs(i);
            } else if (used[i] == 1) {
                z++;

            }
        }
        used[x] = 2;
    }

    public static void main(String[] args) throws IOException {
        int test = nextInt();
        for (int iiiiiii = 0; iiiiiii < test; iiiiiii++) {
            int x = nextInt();
            int y = nextInt();
            int z = nextInt();
            int x1 = x;
            x = Math.max(x, Math.max(y, z));
            if (x == x1 && x == y) {
                out.println("YES");
                out.println(x + " " + z + " 1");
            } else if (x == x1 && x == z) {
                out.println("YES");
                out.println(x + " " + y + " 1");
            } else if (x == y && x == z) {
                out.println("YES");
                out.println(x + " " + x1 + " 1");
            }
            else out.println("NO");
        }
        out.close();
    }


    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static PrintWriter out = new PrintWriter(System.out);
    static StringTokenizer in = new StringTokenizer("");


    public static boolean hasNext() throws IOException {
        if (in.hasMoreTokens()) return true;
        String s;
        while ((s = br.readLine()) != null) {
            in = new StringTokenizer(s);
            if (in.hasMoreTokens()) return true;
        }
        return false;
    }

    public static String nextToken() throws IOException {
        while (!in.hasMoreTokens()) {
            in = new StringTokenizer(br.readLine());
        }
        return in.nextToken();
    }

    public static int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    public static double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    public static long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
}