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.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Code
{
    /*static public long gcd(long j,long k)
    {
        if(j%k==0)
        {
            return k;
        }
        return gcd(k,j%k);
    }*/
    static boolean isPowerOfTwo(int n) 
    { 
        if(n==0) 
            return false; 
        return (int)(Math.ceil((Math.log(n) / Math.log(2)))) ==  (int)(Math.floor(((Math.log(n) / Math.log(2))))); 
    } 
    public static int divisors(int n)
    {
        int cnt=0;
        for (int i = 3; i <= Math.sqrt(n); i = i + 2)
        {
            while (n % i == 0)
            {
                cnt++;
                n = n/i;
                if(cnt==2) break;
            }
        if(cnt==2) 
            break;
        }
        if(n>2)cnt++;
        return cnt; 
    }
    static int gcd(int a, int b) 
    { 
    if (a == 0) 
        return b;  
    return gcd(b % a, a);  
    } 
    static int lcm(int a, int b) 
    { 
        return (a*b)/gcd(a, b); 
    } 
      static long maxPrimeFactors(long n) 
    { 
        long maxPrime = -1; 
        while (n % 2 == 0) { 
            maxPrime = 2; 
            n >>= 1; 
        } 
        for (int i = 3; i <= Math.sqrt(n); i += 2) { 
            while (n % i == 0) { 
                maxPrime = i; 
                n = n / i; 
            } 
        } 
        if (n > 2) 
            maxPrime = n; 
  
        return maxPrime; 
    } 
      static int smallestDivisor(int n)  
{  
    if (n % 2 == 0)  
        return 2;    
    for (int i = 3; i * i <= n; i += 2) {  
        if (n % i == 0)  
            return i;  
    }  
  
    return n;  
}  
  
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int t=sc.nextInt();
        for(int i=0;i<t;i++)
        {
            int x = sc.nextInt();
            int y = sc.nextInt();
            int z = sc.nextInt();
            if(x==y && y==z)
            {
                System.out.println("YES");
                System.out.println(x+" "+x+" "+x);
            }
            else
            {
                if(x==y && y!=z)
                {
                    if(x>z)
                    {
                        System.out.println("YES");
                        System.out.println(x+" "+z+" "+z);
                    }
                    else 
                    {
                        System.out.println("NO");
                    }
            }
            if(x==z && x!=y)
            {
                if(x>y)
                {
                    System.out.println("YES");
                    System.out.println(y+" "+x+" "+y);
                }
                else 
                {
                    System.out.println("NO");
                }
            }
            if(y==z && y!=x)
            {
                if(y>x)
                {
                    System.out.println("YES");
                    System.out.println(x+" "+x+" "+y);
                }
                else 
                {
                    System.out.println("NO");
                }
            }
            if(x!=y && y!=z && z!=x)
            {
                System.out.println("NO");
            }
        }
        }
    }
}