Rain_w and Lines

题号：NC232093
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

Rain_w gives you two different points $P(x_1,y_1),Q(x_2,y_2)$ and a line $l:Ax+By+C=0$ . She wants to know if $P$ and $Q$ are on the same side of the line $l$ . Please help her.

输入描述:

The input has multiple test cases.

The first line contains a single integer $T(1\leq T\leq 10^4)$ - the number of test case.

Next $T$ lines, each line contains 7 integers $x_1,y_1,x_2,y_2,A,B,C(-10^9\leq x_1,y_1,x_2,y_2,A,B,C\leq 10^9)$ separated by space. It is guaranteed that $A^2+B^2\neq 0,(x_1,y_1)\neq (x_2,y_2)$ ,and $P,Q$ are not on the line $l$ .

输出描述:

The output should contains  lines. Each line should be a string "Yes" if  on the same side of the line , or a string "No" if  on the different side of the line .

示例1

输入

复制

2
1 1 -1 -1 1 1 0
1 1 2 2 1 1 0

输出

复制

No
Yes