Three Pairwise Maximums Problem !!!

 PROBLEM 22: Three Pairwise Maximums

Problem Reference : Codeforces 

You are given three positive (i.e. strictly greater than zero) integers x$x$, y$y$ and z$z$.

Your task is to find positive integers a$a$, b$b$ and c$c$ 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 a$a$, b$b$ and c$c$.

You have to answer t$t$ independent test cases. Print required a$a$, b$b$ and c$c$ in any (arbitrary) order.

Input:

The first line of the input contains one integer t$t$ (1≤t≤2⋅104$1\le t\le 2\cdot {10}^4$) — the number of test cases. Then t$t$ test cases follow.

The only line of the test case contains three integers x$x$, y$y$, and z$z$ (1≤x,y,z≤109$1\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 a$a$, b$b$ and c$c$ (1≤a,b,c≤109$1\le a,b,c\le {10}^9$) in the second line. You can print a$a$, b$b$ and c$c$ in any order.

Solution: 

1. t = int(input())
2. i = 0
3. l = []
4. while i < t :
5. i = i + 1
6. l = []
7. x1,y1,z1 = input().split()
8. x = int(x1)
9. y = int(y1)
10. z = int(z1)
11. l.append(x)
12. l.append(y)
13. l.append(z)
14. l.sort()
15. if l[1] != l[2]:
16. print("NO")
17. else:
18. print("YES")
19. print(l[0],l[0],l[2])

The above solution is in python language.

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