You are given three integers $a$, $b$, and $c$. Determine if one of them is the sum of the other two.


-----Input-----

The first line contains a single integer $t$ ($1 \leq t \leq 9261$) — the number of test cases.

The description of each test case consists of three integers $a$, $b$, $c$ ($0 \leq a, b, c \leq 20$).


-----Output-----

For each test case, output "YES" if one of the numbers is the sum of the other two, and "NO" otherwise.

You can output the answer in any case (for example, the strings "yEs", "yes", "Yes" and "YES" will be recognized as a positive answer).


-----Examples-----

Input
7
1 4 3
2 5 8
9 11 20
0 0 0
20 20 20
4 12 3
15 7 8
Output
YES
NO
YES
YES
NO
NO
YES


-----Note-----

In the first test case, $1 + 3 = 4$.

In the second test case, none of the numbers is the sum of the other two.

In the third test case, $9 + 11 = 20$.

Difficulty: EASY
Tags: Implementation

Starter code:

Solutions:
output = ''
for caseno in range(int(input())):
	answer = 'NO'
	(a, b, c) = map(int, input().split())
	l = sorted([a, b, c])
	if l[0] + l[1] == l[2]:
		answer = 'YES'
	output += str(answer) + '\n'
print(output)


import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
	(a, b, c) = map(int, input().split())
	if a + b == c or b + c == a or c + a == b:
		print('YES')
	else:
		print('NO')


import sys

def sol(a: int, b: int, c):
	if abs(b - a) == abs(c) or abs(c - b) == abs(a):
		return 'YES'
	else:
		return 'NO'
t = int(input())
for i in range(t):
	(a, b, c) = list(map(int, sys.stdin.readline().split()))
	print(sol(a, b, c))


n = int(input())
k = [0] * n
for i in range(n):
	(a, b, c) = map(int, input().split())
	if a + b == c or a + c == b or b + c == a:
		k[i] = 'YES'
	else:
		k[i] = 'NO'
for i in k:
	print(i)


f = []
for i in range(int(input())):
	(a, b, c) = map(int, input().split())
	if a + b == c or a + c == b or c + b == a:
		f.append('YES')
	else:
		f.append('NO')
print(*f, sep='\n')


import sys
t = int(input())
for i in range(t):
	(a, b, c) = map(int, sys.stdin.readline().split())
	s1 = a + b
	s2 = b + c
	s3 = c + a
	if s1 == c or s2 == a or s3 == b:
		sys.stdout.write('YES')
	else:
		sys.stdout.write('NO')
	print()


ans = []
for i in range(int(input())):
	(a, b, c) = input().split()
	a = int(a)
	b = int(b)
	c = int(c)
	if a + b == c or a + c == b or b + c == a:
		ans.append('YES')
	else:
		ans.append('NO')
print('\n'.join(ans))


t = int(input())
outputs = []
for i in range(t):
	(a, b, c) = input().split()
	a = int(a)
	b = int(b)
	c = int(c)
	if a + b == c or b + c == a or c + a == b:
		outputs.append('YES')
	else:
		outputs.append('NO')
for output in outputs:
	print(output)


t = int(input())
l = []
for i in range(t):
	(a, b, c) = input().split()
	if int(a) + int(b) == int(c) or int(a) + int(c) == int(b) or int(b) + int(c) == int(a):
		l.append('YES')
	else:
		l.append('NO')
for j in l:
	print(j)


import sys

def get_ints():
	return map(int, sys.stdin.readline().strip().split())

def get_arr():
	return list(map(int, sys.stdin.readline().strip().split()))

def get_string():
	return sys.stdin.readline().strip()
t = int(input())
while t:
	t -= 1
	(a, b, c) = get_ints()
	if a == b + c or b == a + c or c == a + b:
		print('YES')
	else:
		print('NO')


import sys
from collections import *
sys.setrecursionlimit(10 ** 5)
itr = (line for line in sys.stdin.read().strip().split('\n'))
INP = lambda : next(itr)

def ni():
	return int(INP())

def nl():
	return [int(_) for _ in INP().split()]
t = ni()
for case in range(t):
	(a, b, c) = nl()
	if a == b + c or b == a + c or c == a + b:
		print('YES')
	else:
		print('NO')


for n in [*open(0)][1:]:
	(a, b, c) = sorted(map(int, n.split()))
	print('YNEOS'[a + b != c::2])


def main():
	answer = []
	n = int(input())
	for _ in range(n):
		values = list(map(int, input().split()))
		values.sort()
		if values[0] + values[1] == values[2]:
			answer.append('YES')
		else:
			answer.append('NO')
	for _ in answer:
		print(_)
main()


import sys
from heapq import heapify, heappush, heappop
from math import ceil, floor, sqrt, gcd
from collections import defaultdict, deque
input = lambda : sys.stdin.readline().rstrip('\r\n')

def int_arr():
	return list(map(int, input().split()))

def str_arr():
	return list(map(str, input().split()))

def get_str():
	return map(str, input().split())

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

def lcm(a, b):
	return a * b // gcd(a, b)
mod = 1000000007

def solve():
	arr = int_arr()
	arr.sort()
	if arr[0] + arr[1] == arr[2]:
		print('YES')
	else:
		print('NO')
T = 1
T = int(input())
while T:
	solve()
	T -= 1


def main():
	tc = int(input())
	responseTest = ['YES', 'NO']
	resultTest = []
	for _ in range(tc):
		numbers = input().split(' ')
		userData = [int(j) for j in numbers]
		if userData[0] + userData[1] == userData[2]:
			resultTest.append(responseTest[0])
		elif userData[0] + userData[2] == userData[1]:
			resultTest.append(responseTest[0])
		elif userData[1] + userData[2] == userData[0]:
			resultTest.append(responseTest[0])
		else:
			resultTest.append(responseTest[1])
	for res in range(len(resultTest)):
		print(resultTest[res])
main()


for srg in [*open(0)][1:]:
	(d, e, f) = sorted(map(int, srg.split()))
	print('YNEOS'[d + e != f::2])


t = int(input())
L = []
for i in range(t):
	n = [int(a) for a in input().split(' ', 2)]
	if n[1] + n[2] == n[0] or n[0] + n[2] == n[1] or n[0] + n[1] == n[2]:
		L.append('YES')
	else:
		L.append('NO')
for el in L:
	print(el)


s = int(input())

def sums(a, b, c):
	if a + b == c or b + c == a or a + c == b:
		return 'YES'
	else:
		return 'NO'
ss = []
for i in range(s):
	(a, b, c) = map(int, input().split())
	ss.append(sums(a, b, c))
for j in range(s):
	print(ss[j])


import sys
n = int(sys.stdin.readline().rstrip())
for line in sys.stdin:
	(a, b, c) = [int(token) for token in line.split()]
	if a + b == c or a + c == b or b + c == a:
		print('YES')
	else:
		print('NO')


n = int(input())
b = []
for i in range(n):
	a = input()
	a = a.split()
	x = int(a[0])
	y = int(a[1])
	z = int(a[2])
	if x + y == z or x + z == y or y + z == x:
		b.append('YES')
	else:
		b.append('NO')
for item in b:
	print(item)


n = int(input())
ans = []
for i in range(n):
	abc = input().split()
	a = int(abc[0])
	b = int(abc[1])
	c = int(abc[2])
	if a + b == c or a + c == b or b + c == a:
		ans.append('YES')
	else:
		ans.append('NO')
for i in ans:
	print(i)


t = int(input())
R = []
for i in range(t):
	(a, b, c) = [int(i) for i in input().split()]
	if a == b + c or b == a + c or c == a + b:
		R.append('YES')
	else:
		R.append('NO')
print(*R, sep='\n')


from sys import stdin

def main():
	cases = int(stdin.readline().strip())
	for c in range(cases):
		(a, b, c) = map(int, stdin.readline().strip().split())
		if a == b + c or b == a + c or c == a + b:
			print('YES')
		else:
			print('NO')
main()


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


n = int(input())
l = []
ans = []
for i in range(0, n):
	a = list(map(int, input().split()))
	l.append(a)
for i in range(0, n):
	c = max(l[i])
	l[i].remove(c)
	if l[i][0] + l[i][1] == c:
		k = 'YES'
		ans.append(k)
	else:
		k = 'NO'
		ans.append(k)
for i in range(0, n):
	print(ans[i])


n = int(input())
output = []
output = ['***' for i in range(n)]
for i in range(n):
	(a, b, c) = input().split(' ')
	a = int(a)
	b = int(b)
	c = int(c)
	if a + b == c or a + c == b or b + c == a:
		output[i] = 'YES'
	else:
		output[i] = 'NO'
for i in range(n):
	print(output[i])


import sys
input = sys.stdin.readline
for _ in range(int(input())):
	(a, b, c) = map(int, input().split())
	d = max(a, b, c)
	print('YES') if a + b + c - d == d else print('NO')


def func(a, b, c):
	if a + b == c or a + c == b or b + c == a:
		return True
	return False
n = int(input())
result = []
for _ in range(n):
	(a, b, c) = map(int, input().split(' '))
	result.append('YES' if func(a, b, c) else 'NO')
print('\n'.join(result))


from sys import stdin
t = int(stdin.readline())
while t > 0:
	(n1, n2, n3) = stdin.readline().split()
	(n1, n2, n3) = (int(n1), int(n2), int(n3))
	if n1 + n2 == n3 or n1 + n2 == n3 or n1 + n3 == n2 or (n2 + n3 == n1):
		print('YES')
	else:
		print('NO')
	t -= 1


def sum_three(x, y, z):
	if (x + y == z) | (abs(x - y) == z):
		return 'YES'
	else:
		return 'NO'
n = int(input())
answer_arr = ['NO' for j in range(n)]
for i in range(n):
	s = str(input())
	answer_arr[i] = sum_three(int(s.split(' ')[0]), int(s.split(' ')[1]), int(s.split(' ')[2]))
for i in range(n):
	print(answer_arr[i])


n = int(input())
r = []
for i in range(n):
	ar = list(map(int, input().split()))
	r.append(['NO', 'YES'][int(0 in [sum(ar) - x * (len(ar) - 1) for x in ar])])
for line in r:
	print(line)


t = int(input())
l = []
while t:
	l1 = input().split()
	if int(l1[0]) == int(l1[1]) + int(l1[2]):
		l.append('YES')
	elif int(l1[1]) == int(l1[0]) + int(l1[2]):
		l.append('YES')
	elif int(l1[2]) == int(l1[1]) + int(l1[0]):
		l.append('YES')
	else:
		l.append('NO')
	t -= 1
for i in l:
	print(i)


a = int(input())
for i in range(a):
	b = list(map(int, input().split()))
	b = sorted(b)
	if b[0] + b[1] == b[2]:
		print('YES')
	else:
		print('NO')


a = int(input())
l = []
for i in range(a):
	fr = [int(c) for c in input().split()]
	l.append(fr)

def main(arr):
	a = arr[0]
	b = arr[1]
	c = arr[2]
	if a == b + c or b == a + c or c == a + b:
		return 'YES'
	return 'NO'
for i in l:
	print(main(i))


t = int(input())
mas = list()
for i in range(0, t):
	(a, b, c) = map(int, input().split())
	if a == b + c or b == a + c or c == a + b:
		mas.append('YES')
	else:
		mas.append('NO')
for i in range(0, t):
	print(mas[i])


num = int(input())
for i in range(num):
	(x, y, z) = map(int, input().split())
	if x + y == z or y + z == x or z + x == y:
		print('YES')
	else:
		print('NO')


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


N = int(input())
h = []
for i in range(N):
	k = 0
	a = list(map(int, input().split()))
	a1 = a[0]
	b1 = a[1]
	c1 = a[2]
	if a1 == b1 + c1:
		k = 1
	if b1 == a1 + c1:
		k = 1
	if c1 == b1 + a1:
		k = 1
	if k == 1:
		h.append('YES')
	else:
		h.append('NO')
for t in h:
	print(t)


n = int(input())
d = []
for i in range(n):
	(a, b, c) = map(int, input().split())
	maxi = max(a, b, c)
	mini = min(a, b, c)
	avg = a + b + c - mini - maxi
	if avg + mini == maxi:
		d.append('YES')
	else:
		d.append('NO')
for i in range(len(d)):
	print(d[i])


n = int(input())
ans = []
for i in range(n):
	a = []
	a = list(map(int, input().split()))
	if a[0] + a[1] == a[2] or a[0] + a[2] == a[1] or a[1] + a[2] == a[0]:
		ans.append('YES')
	else:
		ans.append('NO')
for i in range(len(ans)):
	print(ans[i])


n = int(input())
l = []
for i in range(n):
	a = input()
	b = a.split()
	if int(b[0]) + int(b[1]) == int(b[2]):
		l += ['YES']
	elif int(b[0]) + int(b[2]) == int(b[1]):
		l += ['YES']
	elif int(b[2]) + int(b[1]) == int(b[0]):
		l += ['YES']
	else:
		l += ['NO']
for i in l:
	print(i)


for i in [0] * int(input()):
	(a, b, c) = map(int, input().split())
	print((a + b == c or b + c == a or c + a == b) and 'YES' or 'NO')


def comp(var, a):
	if int(var[0]) == int(var[1]) + int(var[2]):
		a.append('YES')
	elif int(var[1]) == int(var[0]) + int(var[2]):
		a.append('YES')
	elif int(var[2]) == int(var[0]) + int(var[1]):
		a.append('YES')
	else:
		a.append('NO')

def main():
	b = []
	num = int(input())
	for i in range(num):
		vr = input()
		vr = vr.split()
		comp(vr, b)
	for j in range(len(b)):
		print(b[j])
main()


n = int(input())
arr = list((list(map(int, input().split())) for _ in range(n)))
for i in arr:
	res = 'NO'
	for j in i:
		if sum(i) - j == j:
			res = 'YES'
			break
	print(res)


def findMaxIndex(nums):
	maxIndex = 0
	for i in range(1, len(nums)):
		if nums[maxIndex] < nums[i]:
			maxIndex = i
	return maxIndex
a = int(input())
inputs = []
for i in range(a):
	inputs += [input().split()]
nums = []
for i in range(a):
	nums += [[int(j) for j in inputs[i]]]
for i in range(a):
	l = [0, 1, 2]
	m = findMaxIndex(nums[i])
	l.remove(m)
	if nums[i][m] == nums[i][l[0]] + nums[i][l[1]]:
		print('YES')
	else:
		print('NO')


t = int(input())
s = []
for i in range(t):
	abc = input()
	abc = abc.split()
	s.append([int(x) for x in abc])
for i in range(t):
	b = s[i]
	b.sort()
	if b[2] == b[0] + b[1]:
		print('YES')
	else:
		print('NO')


cases = int(input().rstrip())
ans = []
inp = []
for i in range(cases):
	li = list(map(int, input().rstrip().split(' ')))
	inp.append(li)

def solve(a, b):
	if b == 3:
		return 'NO'
	if a[0] + a[1] == a[2]:
		return 'YES'
	else:
		last = a.pop()
		a.insert(0, last)
		b += 1
		return solve(a, b)
for i in range(cases):
	print(solve(inp[i], 0))


t = int(input())
(a, c) = ([], [])
for i in range(t):
	s = [int(c) for c in input().split()]
	a += s
	if len(a) > 2:
		if a[0] + a[1] == a[2]:
			c.append('YES')
			del a[0]
			del a[0]
			del a[0]
			continue
		elif a[0] + a[2] == a[1]:
			c.append('YES')
			del a[0]
			del a[0]
			del a[0]
			continue
		elif a[1] + a[2] == a[0]:
			c.append('YES')
			del a[0]
			del a[0]
			del a[0]
			continue
		else:
			c.append('NO')
			del a[0]
			del a[0]
			del a[0]
			continue
	else:
		break
print(*c, sep='\n')


t = int(input())
arr = []
for i in range(t):
	(a, b, c) = map(int, input().split())
	if a == b + c or b == a + c or c == a + b:
		answer = 'YES'
	else:
		answer = 'NO'
	arr.append(answer)
for i in arr:
	print(i)


tst = int(input())
vals = []
for i in range(1, tst + 1):
	arr = (a, b, c) = [int(x) for x in input().split()]
	vals.append(arr)
a = int(a)
b = int(b)
c = int(c)
for lst in vals:
	iter = 0
	for i in lst:
		lsum = sum(lst) - i
		if i == lsum:
			print('YES')
			break
		else:
			iter += 1
			if iter == 3:
				print('NO')


t = int(input())
for _ in range(t):
	(a, b, c) = [int(x) for x in input().split()]
	if a + b == c or a + c == b or b + c == a:
		print('YES')
	else:
		print('NO')


import math
for _ in range(int(input())):
	(a, b, c) = map(int, input().split())
	if a == b + c:
		print('YES')
	elif b == a + c:
		print('YES')
	elif c == a + b:
		print('YES')
	else:
		print('NO')


from sre_parse import parse_template
for _ in range(int(input())):
	l = list(map(int, input().split()))
	l.sort()
	if l[-1] == l[0] + l[1]:
		print('YES')
	else:
		print('NO')


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


test = int(input())
while test:
	a = list(map(int, input().split()))
	a = sorted(a)
	if a[2] == a[0] + a[1]:
		print('YES')
	else:
		print('NO')
	test -= 1


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


for i in range(0, int(input())):
	(x, y, z) = [int(x) for x in input().split()]
	if x + y == z or y + z == x or x + z == y:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	(a, b, c) = input().split()
	a = int(a)
	b = int(b)
	c = int(c)
	if a == b + c:
		print('YES')
	elif b == a + c:
		print('YES')
	elif c == a + b:
		print('YES')
	else:
		print('NO')


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


t = int(input())

def sumOfTwo(a, b, c):
	if a == b + c or b == a + c or c == a + b:
		print('YES')
	else:
		print('NO')
for i in range(t):
	(a, b, c) = map(int, input().split())
	sumOfTwo(a, b, c)


l = int(input())
for i in range(l):
	(a, b, c) = [int(x) for x in input().split()]
	if a == b + c or b == a + c or c == a + b:
		print('YES')
	else:
		print('NO')


n = int(input())
for _ in range(n):
	arr = list(map(int, input().split()))
	max_val = max(arr)
	arr.remove(max_val)
	if sum(arr) == max_val:
		print('YES')
	else:
		print('NO')


t = int(input(''))
results = []
for i in range(t):
	(a, b, c) = input('').split()
	if int(a) + int(b) == int(c) or int(a) + int(c) == int(b) or int(b) + int(c) == int(a):
		results.append('YES')
	else:
		results.append('NO')
for i in range(len(results)):
	print(results[i])