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.util.Scanner;

public class Solution {
    public static void mainA(String[] args) {
        final Scanner in = new Scanner(System.in);

        final int T = in.nextInt();

        for (int t = 0; t < T; t += 1) {
            final int x = in.nextInt();
            final int y = in.nextInt();
            final int z = in.nextInt();

//            𝑥=max(𝑎,𝑏), 𝑦=max(𝑎,𝑐) and 𝑧=max(𝑏,𝑐)

            final int max = Math.max(Math.max(x, y), z);
            final int min = Math.min(Math.min(x, y), z);

            if ((x > y && x > z) || (y > x && y > z) || (z > x && z > y)) System.out.println("NO");
            else System.out.println("YES" + "\n" + max + " " + min + " 1");
        }
    }



    public static void mainB(String[] args) {
        final Scanner in = new Scanner(System.in);

        final int T = in.nextInt();

        for (int t = 0; t < T; t += 1) {
            final int rows = in.nextInt();
            final int cols = in.nextInt();

            final int[][] a = new int[rows][cols];

            for (int r = 0; r < rows; r += 1) {
                for (int c = 0; c < cols ; c += 1) {
                    a[r][c] = in.nextInt();
                }
            }
        }
    }



    public static void mainC(String[] args) {
        final Scanner in = new Scanner(System.in);

        final int T = in.nextInt();

        for (int t = 0; t < T; t += 1) {
            final int n = in.nextInt();

            final int k = in.nextInt();


        }
    }



    public static void main(String[] args) {
        mainA(args);
    }
}