爱吃素

显然的结论：任意两个数的积一定不是素数。我们只需要特判等于1的情况即可。

#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
# include<iostream>
# include<iomanip>
# include<algorithm>
# include<cmath>
# include<cstdio>
# include<set>
# include<stack>
# include<queue> 
# include<map>
# include<string>
# include<cstring> 
 
# define eps 1e-9
# define fi first
# define se second
# define ll long long
# define int ll
// cout<<fixed<<setprecision(n) 
using namespace std;
 
typedef unsigned long long ull;
typedef pair<int,int > PII; 
const int mod=1e9+7;
const int MAX=4e5+10;
const int Time=86400;
const int X=131;
const int inf=0x3f3f3f3f;
const double PI = 1e-4;
double pai = 3.14159265358979323846; 

int T,n,k,ans,m;
string s;
bool isprime(int n){
    if(n == 1) return false;
	for(int i = 2 ; i <= n / i ; i ++ )
	 if(n % i == 0) return false;
	 return true;
}
void solve(){
	 cin >> n >> m;
	 if(n == 1 || m == 1){
	 	  if(isprime(max(n,m))) cout<<"YES\n";
	 	    else cout<<"NO\n";
	 }
	 else{
	 	cout<<"NO\n";
	 }
}


signed main(){  
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> T;
    while(T--){
    	solve();
	}

    return 0;
}