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:
//package com.company;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class ThreePairwiseMaximums {
    public static void main(String[] args) {
        Reader1 s1 = new Reader1();
        int t=s1.nextInt();
        for(int i=0;i<t;i++){
        long x=s1.nextLong();
        long y=s1.nextLong();
        long z=s1.nextLong();
        if(x==y&&y==z&&x==z){
            System.out.println("YES");
            System.out.println(x+" "+y+" "+z);
        }else if(x==y&&z<x){
            System.out.println("YES");
            long temp=(z-1);
            if(temp==0){
                temp=z;
            }
            System.out.println(x+" "+z+" "+temp);
        }else if(y==z&&x<y){
            System.out.println("YES");
            long temp=(x-1);
            if(temp==0){
                temp=x;
            }
            System.out.println(temp+" "+x+" "+y);
        }else if(x==z&&y<x){
            System.out.println("YES");
            long temp=(y-1);
            if(temp==0){
                temp=y;
            }
            System.out.println(x+" "+y+" "+temp);
        }else{
            System.out.println("NO");
        }
    }
    }
}
class Reader1 {
    BufferedReader br;
    StringTokenizer st;

    public Reader1() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    String nextLine() {
        String str = "";
        try {
            str = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return str;
    }

}