# haru: pypy
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right


from functools import cache

ok = [(10, 2, 0),
(4, 2, 0),
(2, 4, 0),
(2, 10, 0),

(2, 0, 1),
(0, 2, 1),
(1, 1, 1),

(1, 7, 1),
(7, 1, 1),]

@cache
def naive(l, j, o):
    if min(l, j, o) < 0:
        return False
    if l == j == o == 0:
        return True
    
    for nl, nj, no in ok:
        if naive(l - nl, j - nj, o - no):
            return True
    
    return False

def solve(l, j, o):
    # l, j, o = MI()
    t = l + j + o
    n = 4 * (l + j + o) // 3
    
    if o * 3 > t:
        # print("No")
        return False
    
    if l < j:
        l, j = j, l
    
    # l >= j を保証
    
    if l & 1 != j & 1:
        # print("No")
        return False
    
    # l even, j even
    # print(l, j, o)
    
    p = min(j, o)
    jp = j - p
    op = o - p
    
    if jp & 1:
        if p == 0:
            return False
        # 困る
        p -= 1
        jp += 1
        op += 1
    
    # print(l, p, jp, op)
    
    ok = p * 7 + (jp // 2) * 10 + op * 2
    
    if l > ok:
        # print("No")?r???
        return False
    else:
        # print("Yes")
        return True
    
    
    return

# ma = 30
# for l in range(ma):
#     for j in range(ma):
#         for o in range(ma):
#             if (l + j + o) % 3 != 0:
#                 continue
            
#             f = solve(l, j, o)
#             f2 = naive(l, j, o)
#             if f != f2:
#                 print(l, j, o, f, f2)
#                 assert False


t = int(input())
for i in range(t):
    l, j, o = MI()
    yn(solve(l, j, o))