Problem Statement
Given a rectangle and a point P, determine if P lies INSIDE the rectangle.
Input-
The first line contains a single integer T, denoting the number of test cases.
Each test case contains 2 lines. The first line contains 4 integers: x1, y1, x2 and y2. x1 and y1 denote the coordinate of the bottom-left vertex of the rectangle. x2 and y2 denote the coordinate of the upper-right vertex of the rectangle. The second line has 2 integers: x3 and y3 which denotes the coordinates of the point P.
Output-
For each test case, print "Yes" (without quotes) if the point lies inside the rectangle, or a "No" (without quotes) if it lies outside the rectangle.
Each output should be on a new line.
Constraints-
1<=T<=1000
-2000<=(x1,x2,x3,y1,y2,y3)<=2000
Note:
1. A point will never lie on the rectangle.
2. The sides of the rectangle are always parallel to the coordinate axes.
Sample Input 1: The coordinates of the lower left corner is (-3,-3) and the coordinates of the upper-right corner is (6,4). Thus, the rectangle is formed as above. The coordinates of the point P is (0,0). It is clearly visible from the image that such a point will lie inside the rectangle. Hence, the output for the first test case is Yes.
Sample Input 2: The coordinates of the lower left corner is (0,2) and the coordinates of the upper-right corner is (5,5). Thus, the rectangle is formed as above. The coordinates of the point P is (1,1). It is clearly visible from the image that such a point will lie outside the rectangle. Hence, the output for the second test case is No.
