def p(a,b,c,d): return (a-c)**2+(b-d)**2
def q(a,b,c,d,e,f,g,h): return (a-c)*(f-h)!=(b-d)*(e-g)
for _ in range(int(input())):
    a,b,c,d,e,f,g,h = map(int,input().split())
    i = p(a,b,e,f)==p(c,d,g,h)
    j = p(a,b,c,d)>p(e,f,g,h)
    k = q(a,b,e,f,c,d,g,h) and (q(a,b,c,d,a,b,e,f) or q(c,d,a,b,c,d,g,h))
    print("Yes" if i and (j or k) else "No")