CF1385A.Three Pairwise Maximums

传统题 时间 2000 ms 内存 256 MiB 3 尝试 1 已通过 1 标签

Three Pairwise Maximums

You are given three positive (i.e. strictly greater than zero) integers xx, yy and zz.

Your task is to find positive integers aa, bb and cc such that x=max(a,b)x = \max(a, b), y=max(a,c)y = \max(a, c) and z=max(b,c)z = \max(b, c), or determine that it is impossible to find such aa, bb and cc.

You have to answer tt independent test cases. Print required aa, bb and cc in any (arbitrary) order.

Input

The first line of the input contains one integer tt (1t21041 \le t \le 2 \cdot 10^4) — the number of test cases. Then tt test cases follow.

The only line of the test case contains three integers xx, yy, and zz (1x,y,z1091 \le x, y, z \le 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 aa, bb and cc (1a,b,c1091 \le a, b, c \le 10^9) in the second line. You can print aa, bb and cc in any order.

Samples

5
3 2 3
100 100 100
50 49 49
10 30 20
1 1000000000 1000000000
YES
3 2 1
YES
100 100 100
NO
NO
YES
1 1 1000000000

在线编程 IDE

建议全屏模式获得最佳体验