Little Rabbit and Little Horse have been fighting for collegiate programming contest for almost four years. They plan to retire this year and so is it for many other members of the animal training team. Retirement means parting, and parting is inevitably full of sadness. If the retirement of one member will make the animal training team sad, then the retirement of multiple members will make everyone *cry* and fail to complete the final contest. Little Rabbit doesn't want this to happen, and he tells Little Horse to manage the number of retirements in each contest.
They get the list of the training teams and screened out the list of members who are expected to retire this year. Members in the list either participate in one contest or two contests — that's the rule of collegiate programming contest. Then each of the members who would like to retire will choose one contest he participates in to retire at that time. A contest can be described as a tuple $angle.l x, y angle.r$, where $x$ represents the time, and $y$ represents the location. To simplify the problem, $x$ and $y$ are both positive integers and two contests $A$ and $B$ are defined to be *close* if $| A. x -B. x | <= d_x$ or $| A. y -B. y | <= d_y$. If any two members choose to retire in the same contest or two *close* contests, then everyone will be very sad and *cry*.
Little Rabbit and Little Horse want to know whether they can arrange everyone's retirement contests so that everyone will not *cry* and make it better to complete their final contests.
The input contains several test cases.
The first line contains a single integer $T " "(1 <= T <= 10^5)$, indicating the number of test cases.
For each test case: the first line contains three integers $n " "(1 <= n <= 2 dot.op 10^4)$ indicating the number of members who will retire this year, $d_x$ and $d_y " "(1 <= d_x, d_y <= 10^9)$ described above. Following $n$ lines, the $i$-th line starts with one integer $k " "(1 <= k <= 2)$ indicating the $i$-th member will take $k$ contest(s). Then $k$ tuple(s) $angle.l x, y angle.r " "(1 <= x, y <= 10^9)$ follow, each describing the information of a contest.
It is guaranteed that the sum of $n$ will not exceed $10^5$.
For each test case, output the following text in a line: _Yes_ if there is some arrangement so that everyone will not *cry*, or _No_ if there does not exist such arrangement.
## Input
The input contains several test cases.The first line contains a single integer $T " "(1 <= T <= 10^5)$, indicating the number of test cases.For each test case: the first line contains three integers $n " "(1 <= n <= 2 dot.op 10^4)$ indicating the number of members who will retire this year, $d_x$ and $d_y " "(1 <= d_x, d_y <= 10^9)$ described above. Following $n$ lines, the $i$-th line starts with one integer $k " "(1 <= k <= 2)$ indicating the $i$-th member will take $k$ contest(s). Then $k$ tuple(s) $angle.l x, y angle.r " "(1 <= x, y <= 10^9)$ follow, each describing the information of a contest.It is guaranteed that the sum of $n$ will not exceed $10^5$.
## Output
For each test case, output the following text in a line: _Yes_ if there is some arrangement so that everyone will not *cry*, or _No_ if there does not exist such arrangement.
[samples]
**Definitions**
Let $ N, M \in \mathbb{Z}^+ $ with $ 1 \leq N, M \leq 1000 $.
For each accessory kind $ i \in \{1, \dots, N\} $, let $ A_i = \{(s_{i,j}, p_{i,j}) \mid j \in \{1, \dots, M\}\} $ be a set of $ M $ accessories, where:
- $ s_{i,j} \in \mathbb{Z}^+ $ is the service life of the $ j $-th accessory of kind $ i $,
- $ p_{i,j} \in \mathbb{Z}^+ $ is its price,
and $ s_{i,1} < s_{i,2} < \dots < s_{i,M} $.
**Constraints**
For all $ i \in \{1, \dots, N\} $, $ j \in \{1, \dots, M\} $:
- $ 1 \leq s_{i,j} \leq 1000 $,
- $ 1 \leq p_{i,j} \leq 10^6 $.
**Objective**
Choose one accessory $ (s_{i,j_i}, p_{i,j_i}) $ from each kind $ i $ to form a computer.
The computer’s life is $ L = \min_{i=1}^N s_{i,j_i} $.
The total cost is $ C = \sum_{i=1}^N p_{i,j_i} $.
Define the cost-per-unit-time as $ R = \frac{C}{L} $.
Minimize $ R $. If multiple combinations yield the same minimal $ R $, choose the one with minimal $ C $.
Output the minimal total price $ C $ achieving the minimal $ R $.