import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
input = sys.stdin.readline
#n = int(input())
#a = list(map(int,input().split()))
#a = []
#s = input()
#
#for i in range(n):
#    a.append(list(map(int,input().split())))
def solve():
    ax, ay, bx, by, cx, cy = map(int, input().split())

    x = ax * bx - ay * by
    y = ax * by + ay * bx

    print('Yes' if x * cy == y * cx and x * cx + y * cy > 0 else 'No')

for i in range(int(input())):solve()