Codeforces Round #639 (Div. 2) A.Puzzle Pieces

Codeforces Round #639 (Div. 2) A.Puzzle Pieces

You are given a special jigsaw puzzle consisting of n⋅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:

The pieces are arranged into a grid with n rows and m columns.
For any two pieces that share an edge in the grid, a tab of one piece fits perfectly into a blank of the other piece.
Through rotation and translation of the pieces, determine if it is possible to solve the jigsaw puzzle.

Input

The test consists of multiple test cases. The first line contains a single integer t (1≤t≤1000) — the number of test cases. Next t lines contain descriptions of test cases.

Each test case contains two integers n and m (1≤n,m≤1e5).

Output

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).

Example

input

3
1 3
100000 100000
2 2

output

YES
NO
YES

比较有意思的一道题目，我们发现只有一排时，长度是任意的，而当排列为 2×2 时，观察样例解释发现 8 个角都是凸起的，此时不可能再放上多余的拼图了，AC代码如下：

#include
using namespace std;

main()
{
    int t,n,m;
    cin>>t;
    while(t--){
        cin>>n>>m;
        if(n==1 || m==1 || (n==2 && m==2)) puts("YES");
        else puts("NO");
    }
}