#include<cstdio>
#include<cmath>
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<vector>
#include<list>
#define pi 4*atan(1)
#define eps 1e-10
#define INF 0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define FF(i,n) for(int i = 0 ; i < n ; i++)
#define F(i,n) for(int i = 1 ; i <= n ; i++)
#define maxn 100000+10
#define mod 200907
#define met(a) memset(a,0,sizeof(a))
typedef long long LL;
//typedef __int64 LL;
using namespace std;
void read(int &x){
    #define CH getchar()
    char ch; x=0;for(ch=CH;ch<'0'||ch>'9';ch=CH);
    for(;ch>='0'&&ch<='9';x=x*10+ch-48,ch=CH);
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,m;
        cin>>n>>m;
        int nn=180-360/n,mm=180-360/m;
        bool flag=false;
        for(int i=0;i*nn<=360;i++)
        {
            for(int j=0;j*mm<=360;j++)
            {
                if(i*nn+j*mm==360)
                {
                    flag=true;
                    break;
                }
            }
            if(flag)break;
        }
        if(flag)cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
    return 0;
}