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

public class Simple {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int i=0,j=0,k=0;
        int t=0;
        t=sc.nextInt();
        while (t-->0)
        {
            int arr[]={sc.nextInt(),sc.nextInt(),sc.nextInt()};
            int a=arr[0];
            int b=arr[1];
            int c=arr[2];
            Arrays.sort(arr);
            if (arr[2]!=arr[1])
            {
                System.out.println("NO");
            }
            else
            {
                System.out.println("YES");
                if (arr[2]==a)
                {
                    if (arr[2]==b)
                    {
                        System.out.println(arr[2]+" "+arr[0]+" "+arr[0]);
                    }
                    else
                    {
                        System.out.println(arr[0]+" "+arr[2]+" "+arr[0]);
                    }
                }
                else
                {
                    System.out.println(arr[0]+" "+arr[0]+" "+arr[2]);
                }
            }
        }
























    }

    static boolean isPrime(long n) {
        if(n < 2) return false;
        if(n == 2 || n == 3) return true;
        if(n%2 == 0 || n%3 == 0) return false;
        long sqrtN = (long)Math.sqrt(n)+1;
        for(long i = 6L; i <= sqrtN; i += 6) {
            if(n%(i-1) == 0 || n%(i+1) == 0) return false;
        }
        return true;
    }
}