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.lang.reflect.Array;
import java.util.Arrays;
import java.util.Scanner;

public class Program {
    public static void main(String[] args) throws Exception {

        Scanner input = new Scanner(System.in);

        int t = input.nextInt();
        // a >= b >= c
        // a  a  b
        for(int i=0; i<t; i++) {
            int[] nums = new int[3];
            nums[0] = input.nextInt();
            nums[1] = input.nextInt();
            nums[2] = input.nextInt();
            Arrays.sort(nums);

            String result = getResult(nums);
            System.out.println(result);
        }
    }

    public static String getResult(int[] nums) {
        String answer = "";
        if(isValid(nums)) {
            answer = "YES\n";
            if(nums[2] == nums[1])
                answer += nums[2] + " " + nums[0] + " " + nums[0];
            else
                answer += nums[2] + " " + nums[2] + " " + nums[1];
        }else
            answer = "NO";
        return answer;
    }

    /* if there is multiple minimum, this is invalid */
    public static boolean isValid(int[] nums) {
        if(nums[0] == nums[1] && nums[0] != nums[2] || nums[0] < nums[1] && nums[1] < nums[2])
            return false;
        return true;
    }
}