正n边形的内角度数为 (n-2)/n*180 所以可以设取a个n角b个m角(a,b≤6)枚举ab即可
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pii;
#define bug puts("===========");
const double pi=(acos(-1.0));
const double eps=1e-8;
const ll INF=1e18+10;
const ll inf=1e14;
const int maxn=1000+10;
const int mod=100000007;
/*===============================*/
bool go(int n,int m){
for(int a=0;a<=10;a++){
if(2*a%n==0&&a-2*a/n==2) return 1;
if(2*a%m==0&&a-2*a/m==2) return 1;
for(int b=0;b<=10;b++){
int z=2*a*m+2*b*n;
if(z%(n*m)==0&&a+b-z/n/m==2) return 1;
}
}
return 0;
}
int main()
{
int T_T,n,m;
scanf("%d",&T_T);
while(T_T--){
scanf("%d%d",&n,&m);
if(go(n,m)) puts("Yes");
else puts("No");
}
return 0;
}