Puzzle Pieces

You are given a special jigsaw puzzle consisting of n⋅mn⋅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 nn rows and mm 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 tt (1≤t≤10001≤t≤1000) — the number of test cases. Next tt lines contain descriptions of test cases.

Each test case contains two integers nn and mm (1≤n,m≤1051≤n,m≤105).

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

Sample Input

3
1 3
100000 100000
2 2

Sample Output

YES
NO
YES

Note

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:

题目大意：

问是否可以将拼图拼成n*m的矩形

解题思路：

①只有一排时，长度是任意的
②当排列为 2*2 时， 8个角都是向外凸起的，此时不能再放拼图

代码如下：

#include<iostream>
#include<algorithm>
#include<cstdio>

using namespace std;

int main()
{
	int t,n,m;
	scanf("%d",&t);
	while(t--){
		scanf("%d %d",&n,&m);
		if(n==1||m==1||(n==2&&m==2)) 
			printf("YES\n");
		else 
			printf("NO\n");
	}
	return 0;
}