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.InputStreamReader;
import java.io.PrintWriter;
import java.sql.Array;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.util.Map.Entry;


import java.util.*;

public class a {
	static long mod = 1000000007L;

	 public static void main(String[] args) throws Exception {
	        in = new BufferedReader(new InputStreamReader(System.in));
	        out = new PrintWriter(System.out);
	        sc = new FastScanner(in);
	       HashMap<Integer , HashMap<Integer , ArrayList<Integer>>> map = new HashMap<>();
	       int t =sc.nextInt();
	       while(t-->0) {
	    	   int n =3;
	    	 long [] a = input(n);
	    	 Arrays.sort(a);
	    	 if(a[2]==a[1]) {
	    		 System.out.println("YES");
	    		 System.out.println(a[0] +" "+a[0]+" "+a[2]);
	    	 }else {
	    		 System.out.println("NO");
	    	 }
	       	}
	       
	       
	       
	      
	        out.flush();    
	    }
	 static class pair {
		 int ver ;
		 int val;
	 }
	 
	static int[] par;
	static int[] rank;

	static void build(int n) {
		par = new int[n + 1];
		rank = new int[n + 1];
		for (int i = 0; i < n; i++)
			par[i] = i;
	}

	static int find(int u) {
		if (u == par[u])
			return u;
		int v = find(par[u]);
		par[u] = v;
		return v;
	}

	static void union(int u, int v) {
		u = par[u];
		v = par[v];

		if (rank[u] > rank[v]) {
			par[v] = u;
		} else {
			par[u] = v;
			if (rank[u] == rank[v]) {
				rank[v]++;
			}
		}
	}




	public static TreeMap<Integer, TreeSet<Integer>> directed(int n, int m) throws Exception {
		TreeMap<Integer, TreeSet<Integer>> map = new TreeMap<>();
		for (int i = 0; i < n; i++)
			map.put(i, new TreeSet<Integer>());
		for (int i = 0; i < m; i++) {
			int a = sc.nextInt() - 1;
			int b = i;
			map.get(b).add(a);
		}
		return map;
	}

	public static long[] input(int n) throws Exception {

		long[] arr = new long[n];
		for (int i = 0; i < n; i++) {
			arr[i] = sc.nextLong();
		}
		return arr;
	}

	public static long[][] input(int n, int m) throws Exception {

		long[][] arr = new long[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {

				arr[i][j] = sc.nextInt();
			}
		}
		return arr;
	}

	static BufferedReader in;
	static FastScanner sc;
	static PrintWriter out;

	static class FastScanner {
		BufferedReader in;
		StringTokenizer st;

		public FastScanner(BufferedReader in) {
			this.in = in;
		}

		public String nextToken() throws Exception {
			while (st == null || !st.hasMoreTokens()) {
				st = new StringTokenizer(in.readLine());
			}
			return st.nextToken();
		}

		public int nextInt() throws Exception {
			return Integer.parseInt(nextToken());
		}

		public long nextLong() throws Exception {
			return Long.parseLong(nextToken());
		}

		public double nextDouble() throws Exception {
			return Double.parseDouble(nextToken());
		}
	}
}