def distance(A, B):
    A_X, A_Y = A
    B_X, B_Y = B
    return (A_X - B_X) ** 2 + (A_Y - B_Y) ** 2

def solve():
    A_x, A_y, B_x, B_y, C_x, C_y = map(int, input().split())
    assert 0 <= A_x <= 10**6
    assert 0 <= A_y <= 10**6
    assert 0 <= B_x <= 10**6
    assert 0 <= B_y <= 10**6
    assert -10**6 <= C_x <= 10**6
    assert 0 <= C_y <= 10**6
    
    assert (A_x, A_y) != (0, 0)
    assert (B_x, B_y) != (0, 0)
    assert (C_x, C_y) != (0, 0)

    B_y *= -1
    
    A = (A_x, A_y)
    B = (B_x, B_y)
    C = (C_x, C_y)
    
    AO = distance(A, (0, 0))
    BO = distance(B, (0, 0))
    AB = distance(A, B)
    CO = distance(C, (0, 0))
    C1 = distance(C, (1, 0))
    O1 = distance((0, 0), (1, 0))
    
    cos_AOB = (AO + BO - AB)**2 * (4 * CO * O1)
    cos_CO1 = (CO + O1 - C1)**2 * (4 * AO * BO)
    
    if (AO + BO <= AB) == (CO + O1 <= C1):
        print("Yes" if cos_AOB == cos_CO1 else "No")
    else:
        print("No")


if __name__ == "__main__":
    T = int(input())
    assert 1 <= T <= 200000
    for _ in range(T):
        solve()