题目描述
Hannibal is on a mission. He has to shoot a criminal. Hannibal was on the point (0, 0) and the criminal is on the point (Xc, Yc). But there is a wall between the point (X1, Y1) and (X2, Y2).
You have to tell whether Hannibal can shoot criminal or not.
INPUT:
First line contains the total number of test cases T. For each test case, a single line contains space separated integers denoting X1, Y1, X2, Y2, Xc, Yc.
OUTPUT:
For each test case display YES, if Hannibal can shoot the criminal. Otherwise, display NO.
Constraints:
1 ≤ T ≤ 100
1 ≤ X, Y ≤ 1000000
SAMPLE INPUT
2
1 1 2 2 3 3
2 2 3 3 1 1
SAMPLE OUTPUT
NO
YES
输入格式
见题面
输出格式
见题面
样例输入
2
1 1 2 2 3 3
2 2 3 3 1 1
SAMPLE
样例输出
NO
YES