Description

Giant Kingdom creates tons of drinkable water, and will discharge the water into an ocean. The ocean can be simplified to a 3-dimensional space. Because of some magic, there are 3 surfaces, 1000|x| = y²+z², 1000|y| = x² + z², 1000|z| = x²+ y² , and water can’t pass through any of the surfaces. Baby Kingdom is worried about whether the drinkable water can reach their country. Given are two coordinates (x₁, y₁, z₁),(x₂, y₂, z₂) indicate the position of Giant Kingdom and the position of Baby Kingdom. Please find out weather the drinkable water can reach Baby Kingdom. It is guaranteed that both countries do not located in any of the surfaces. You need to answer T queries.

Input

First line contains one integer T (1 ≤ T ≤ 10³ ).

Next T lines, the i-th line contains 6 integers x₁, y₁, z₁, x₂, y₂, z₂ (−10⁹ ≤ x₁, y₁, z₁, x₂, y₂, z₂ ≤ 10⁹ ), indicating the i-th query.

Output

T lines, in the i-th line print Yes if the drinkable water can reach Baby Kingdom, print No otherwise

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

Yes
No
No

Hint

In example, query 3, the surface divide (1, 0, 0),(1, 1, 0) is 1000|y| = x²+ z².