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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class PairwiseMax {
    public static void main(String[] args) throws IOException {
        BufferedReader bfr = new BufferedReader(new InputStreamReader(System.in));
        int nOfCases = Integer.parseInt(bfr.readLine());
        for (int i = 0; i < nOfCases; i++) {
            String[] s = bfr.readLine().split(" ");
            int[] arr = new int[3];
            arr[0] = Integer.parseInt(s[0]);
            arr[1] = Integer.parseInt(s[1]);
            arr[2] = Integer.parseInt(s[2]);
            int common = 0;
            int uncommonIndex = -1;
            if (arr[0] == arr[1]) {
                common = arr[1];
                uncommonIndex = 2;
            }
            if (arr[1] == arr[2]) {
                common = arr[1];
                uncommonIndex = 0;
            }
            if (arr[0] == arr[2]) {
                common = arr[0];
                uncommonIndex = 1;
            }
            if (uncommonIndex == -1 || common < arr[uncommonIndex]) {
                System.out.println("NO");
            } else {
                System.out.println("YES");
                if (uncommonIndex == 0) {
                    System.out.println(arr[uncommonIndex] + " " + arr[uncommonIndex] + " " + common);
                }
                if (uncommonIndex == 1) {
                    System.out.println(arr[uncommonIndex] + " " + common + " " + arr[uncommonIndex]);
                }
                if (uncommonIndex == 2) {
                    System.out.println(common + " " + arr[uncommonIndex] + " " + arr[uncommonIndex]);
                }
            }
        }
    }
}