珑

时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 1024 M，其他语言2048 M
Special Judge, 64bit IO Format: %lld

题目描述

You need to cover an $n \times m$ rectangle using several $1 \times 2$ or $2 \times 1$ dominoes. Each position must be covered exactly once, and the dominoes must not extend outside the rectangle.

Additionally, there may be two types of constraints:

1. The short sides of the dominoes cannot be adjacent, meaning no two dominoes can share a side of length 1.
2. The long sides of the dominoes cannot be adjacent, meaning no two dominoes can share a side of length 2 (even if they only share one edge).

There are $T$ queries, each giving $n, m, a, b$ , representing the size of the rectangle and whether the two constraints exist. When $a$ is 0, the first constraint exists; when $a$ is 1, the first constraint does not exist. When $b$ is 0, the second constraint exists; when $b$ is 1, the second constraint does not exist. For each query, you need to determine if there is a way to cover the entire rectangle.

输入描述:

The first line contains a positive integer .

The next  lines each contain four integers .

输出描述:

For each query, output "Yes" or "No" indicating whether there is a way to cover the entire rectangle.

示例1

输入

复制

输出

复制

No
Yes
No
No
Yes

题目描述

输入描述:

输出描述:

输入

输出

备注: