|Codeforces Round #639 (Div. 2)|
You are given a special jigsaw puzzle consisting of $$$n\cdot m$$$ identical pieces. Every piece has three tabs and one blank, as pictured below.
The jigsaw puzzle is considered solved if the following conditions hold:
Through rotation and translation of the pieces, determine if it is possible to solve the jigsaw puzzle.
The test consists of multiple test cases. The first line contains a single integer $$$t$$$ ($$$1\le t\le 1000$$$) — the number of test cases. Next $$$t$$$ lines contain descriptions of test cases.
Each test case contains two integers $$$n$$$ and $$$m$$$ ($$$1 \le n,m \le 10^5$$$).
For each test case output a single line containing "YES" if it is possible to solve the jigsaw puzzle, or "NO" otherwise. You can print each letter in any case (upper or lower).
3 1 3 100000 100000 2 2
YES NO YES
For the first test case, this is an example solution:
For the second test case, we can show that no solution exists.
For the third test case, this is an example solution: