for _ in range(int(input())):
n, m = list(map(int, input().split(' ')))
if 1 in [n, m] or n == m == 2:
print('YES')
else:
print('NO')
#include<bits/stdc++.h>
using namespace std;
int main (){
long long int n,p,k,j,x,y;
int t,a[1000],i;
cin>>t;
for(i=0;i<t;++i){
cin>>x>>y;
if((x==1)||(y==1)){a[i]=1; }
else if(x==2){if(y<=2){a[i]=1; }else{a[i]=0; } }
else if(y==2){if(x<=2){a[i]=1; }else{a[i]=0; } }
else{a[i]=0; } }
for(i=0;i<t;++i){if(a[i]==1){cout<<"YES"<<endl; } else{cout<<"NO"<<endl; } }
}
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |