There are 3 hidden numbers A, B, C.

You somehow found out the values of \min(A, B), \min(B, C), and \min(C, A).

Determine whether there exists any tuple (A, B, C) that satisfies the given values of \min(A, B), \min(B, C), \min(C, A).

------ Input Format ------ 

- The first line of input will contain a single integer T, denoting the number of test cases.
- The first and only line of each test case contains 3 space-separated integers denoting the values of \min(A, B), \min(B, C), and \min(C, A).

------ Output Format ------ 

For each test case, output YES if there exists any valid tuple (A, B, C), and NO otherwise.

You can print each letter of the output in any case. For example YES, yes, yEs will all be considered equivalent.

------ Constraints ------ 

$1 ≤ T ≤ 1000$
$1 ≤ min(A, B), min(B, C), min(C, A) ≤ 10$

----- Sample Input 1 ------ 
3
5 5 5
2 3 4
2 2 4

----- Sample Output 1 ------ 
YES
NO
YES

----- explanation 1 ------ 
Test case $1$: One valid tuple $(A, B, C)$ is $(5, 5, 5)$.

Test case $2$: It can be shown that there is no valid tuple $(A, B, C)$.

Test case $3$: One valid tuple $(A, B, C)$ is $(4, 2, 5)$.

Difficulty: EASY

Solutions:
for _ in range(int(input())):
	abc = list(map(int, input().split()))
	print('YES' if abc.count(min(abc)) >= 2 else 'NO')


for i in range(int(input())):
	a = list(map(int, input().split()))
	if a.count(min(a)) >= 2:
		print('YES')
	else:
		print('NO')


for i in range(int(input())):
	c1 = 0
	(mab, mbc, mca) = map(int, input().split())
	if mab == mbc and mbc == mca and (mca == mab):
		print('YES')
	elif mab == mbc:
		b = mab
		for j in range(0, max(b, mca) + 1):
			a = b + j
			c = b + j + 1
			if min(a, b) == mab and min(b, c) == mbc and (min(c, a) == mca):
				c1 += 1
				break
		if c1 == 1:
			print('YES')
		else:
			print('NO')
	elif mbc == mca:
		c = mca
		for j in range(0, max(c, mab) + 1):
			a = c + j
			b = c + j + 1
			if min(a, b) == mab and min(b, c) == mbc and (min(c, a) == mca):
				c1 += 1
				break
		if c1 == 1:
			print('YES')
		else:
			print('NO')
	elif mab == mca:
		a = mab
		for j in range(0, max(a, mbc) + 1):
			b = a + j
			c = a + j + 1
			if min(a, b) == mab and min(b, c) == mbc and (min(c, a) == mca):
				c1 += 1
				break
		if c1 == 1:
			print('YES')
		else:
			print('NO')
	else:
		print('NO')


for i in range(int(input())):
	l = list(map(int, input().split()))
	r = min(l)
	res = l.count(r)
	if res >= 2:
		print('YES')
	else:
		print('NO')


n = int(input())
for i in range(0, n):
	(a, b, c) = map(int, input().split())
	m = min(a, b)
	n = min(b, c)
	o = min(c, a)
	if m == n and n == o and (o == m):
		print('YES')
	else:
		print('NO')


import sys
n = int(input())
for i in range(n):
	a = [int(x) for x in input().split()]
	print('YES' if a.count(min(a)) >= 2 else 'NO')


import math

def bp():
	return int(input())

def ip():
	return map(int, input().split())

def ls():
	return list(map(int, input().split()))
t = int(input())
for i in range(t):
	a = ls()
	print('YES' if a.count(min(a)) >= 2 else 'NO')


import sys
for _ in range(int(sys.stdin.readline())):
	a = list(map(int, sys.stdin.readline().split()))
	sys.stdout.write('YES\n' if a.count(min(a)) >= 2 else 'NO\n')


t = int(input())
for _ in range(t):
	lst = list(map(int, input().split()))
	s = set(lst)
	if lst.count(min(lst)) >= 2:
		print('YES')
	else:
		print('NO')


def solve():
	A = [int(i) for i in input().split()]
	if A.count(min(A)) >= 2:
		return 'YES'
	return 'NO'
t = int(input())
while t:
	print(solve())
	t -= 1


t = int(input())
for tc in range(t):
	(a, b, c) = map(int, input().split())
	if min(a, b) == min(b, c) == min(c, a):
		print('YES')
	else:
		print('NO')


for i in range(int(input())):
	(a, b, c) = map(int, input().split())
	print('YES' if min(a, b) == min(b, c) == min(a, c) else 'NO')


for _ in range(int(input())):
	(a, b, c) = map(int, input().split())
	g = min(a, b, c)
	if min(a, b) == g and min(b, c) == g and (min(c, a) == g):
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	a = [int(i) for i in input().split()]
	a.sort()
	if a[0] == a[1]:
		print('YES')
	else:
		print('NO')


for t in range(int(input())):
	lis = list(map(int, input().split(' ')))
	if len(set(lis)) == 3:
		print('NO')
	elif len(set(lis)) == 2 and lis.count(max(lis)) == 2:
		print('NO')
	else:
		print('YES')


for t in range(int(input())):
	(ab, bc, ca) = map(int, input().split(' '))
	lis = []
	lis.append(ab)
	lis.append(bc)
	lis.append(ca)
	if len(set(lis)) == 3:
		print('NO')
	elif len(set(lis)) == 2 and lis.count(max(lis)) == 2:
		print('NO')
	else:
		print('YES')


T = int(input())
for _ in range(T):
	(a, b, c) = map(int, input().split())
	if a == b and c > a or (b == c and a > b) or (c == a and b > a) or (a == b == c):
		print('YES')
	else:
		print('NO')


for i in range(int(input())):
	l = list(map(int, input().split()))
	m = min(l)
	s = set(l)
	if len(s) > 2:
		print('NO')
	elif l.count(m) < 2:
		print('NO')
	else:
		print('YES')


for i in range(int(input())):
	l = list(map(int, input().split()))
	l.sort()
	if l[0] == l[1]:
		print('YES')
	else:
		print('NO')


import numpy as n
for i in range(int(input())):
	a = [int(x) for x in input().split()]
	b = n.unique(a)
	if len(a) != len(b):
		if len(b) == 1:
			print('YES')
		elif a.count(b[0]) == 2:
			if b[1] >= b[0]:
				print('YES')
			else:
				print('NO')
		elif b[1] <= b[0]:
			print('YES')
		else:
			print('NO')
	else:
		print('NO')


t = int(input())
for it in range(t):
	x = list(map(int, input().split()))
	a = min(x)
	c = 0
	for item in x:
		if item == a:
			c += 1
	if c > 1:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(ma, mb, mc) = list(map(int, input().split()))
	count = 0
	for a in range(1, 10 + 1):
		for b in range(1, 10 + 1):
			for c in range(1, 10 + 1):
				if ma == min(a, b) and mb == min(b, c) and (mc == min(c, a)):
					count += 1
					break
	if count >= 1:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	(minAB, minBC, minCA) = map(int, input().split())
	if minAB <= minBC and minAB == minCA or (minAB >= minBC and minBC == minCA) or (minAB == minBC and minCA >= minAB) or ((minAB == minCA or minBC == minCA) and minCA == min([minAB, minBC])):
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	a = list(map(int, input().split()))
	k = a.count(min(a))
	if k == 2 or k == 3:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	a = [int(x) for x in input().split()]
	a.sort()
	if a[0] == a[1]:
		print('YES')
	else:
		print('NO')


def f(a, b, c1):
	d = min(a, b, c1)
	c = 0
	if d == a:
		c += 1
	if d == b:
		c += 1
	if d == c1:
		c += 1
	return c
t = int(input())
while t:
	t -= 1
	(a, b, c) = map(int, input().split())
	if f(a, b, c) >= 2:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	(x, y, z) = map(int, input().split())
	if x == y and y <= z or (y == z and z <= x) or (z == x and x <= y):
		print('YES')
	else:
		print('NO')


import os, sys, io, math
from re import *
from math import *
from array import *
from heapq import *
from bisect import *
from functools import *
from itertools import *
from statistics import *
from collections import *
I = lambda : [*map(int, sys.stdin.readline().split())]
IP = lambda : map(int, input().split())
IS = lambda : input()
IN = lambda : int(input())
IF = lambda : float(input())
for _ in range(IN()):
	l = I()
	if l.count(min(l)) >= 2:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	a = list(map(int, input().split()))
	a.sort()
	if a[0] == a[1]:
		print('YES')
	else:
		print('NO')