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;
import java.util.stream.Stream;

public class LastClassOfMath {


    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        int tc = Integer.parseInt(bufferedReader.readLine());

        while (tc-- > 0) {
            long[] input = Stream.of(bufferedReader.readLine().split(" ")).mapToLong(Integer::parseInt).toArray();
            long x = input[0];
            long y = input[1];
            long z = input[2];

            int count = 0;
            int index = -1;
            long min = input[0];
            int minIndex = 0;
            for (int i = 0; i < input.length; i++) {
                if (input[i] == input[(i+1)%input.length]) {
                    ++count;
                    index = i;
                } else if (min > input[i]){
                    min = input[i];
                    minIndex = i;
                }
            }

            if (count == 0 || (count == 1 && min == input[index])) {
                System.out.println("NO");
            } else if (count == 1) {
                System.out.println("YES");
                System.out.println(input[index] + " "+input[minIndex] + " "+(input[minIndex]>1 ? --input[minIndex] : input[minIndex]));
            } else if (count == 3) {
                System.out.println("YES");
                System.out.println(input[0] + " "+input[0] + " "+input[0]);
            }
        }

    }

}