## Possible Path

by amititkgp

Adam is standing at point in an infinite 2D grid. He wants to know if he can reach point or not. The only operation he can do is to move to point from some point . It is given that he can move to any point on this 2D grid, i.e., the points having positive or negative (or ) co-ordinates.

Tell Adam whether he can reach or not.

**Input Format**

The first line contains an integer, , followed by lines, each containing space-separated integers i.e. , , and .

**Constraints**

**Output Format**

For each test case, display `YES`

or `NO`

that indicates if Adam can reach or not.

**Sample Input**

```
3
1 1 2 3
2 1 2 3
3 3 1 1
```

**Sample Output**

```
YES
YES
NO
```

**Explanation**

- (1,1) -> (2,1) -> (2,3).