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.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class Three_Pairwise_Maximums {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int t = Integer.parseInt(br.readLine());
        while (t-- > 0) {
            StringTokenizer st = new StringTokenizer(br.readLine());
            int x =Integer.parseInt(st.nextToken());
            int y =Integer.parseInt(st.nextToken());
            int z =Integer.parseInt(st.nextToken());
            int [] arr =new int [3];
            arr[0]=x;
            arr[1]=y;
            arr[2]=z;
            Arrays.sort(arr);
            TreeSet<Integer> set =new TreeSet<>();
            set.add(x);
            set.add(y);
            set.add(z);
            if (set.size()==3)
                System.out.println("NO");
            else
                if (set.size()==2){
                    int ans1 =set.pollFirst();
                    int ans2= set.pollFirst();
                    if (arr[0]==arr[1])
                        System.out.println("NO");
                    else {
                        System.out.println("YES");
                        System.out.println(ans2 + " " + ans1 + " " + ans1);
                    }
                }else{
                    int ans =set.pollFirst();
                    System.out.println("YES");
                    System.out.println(ans+" "+ans+" "+ans);
                }
        }
    }
}