#include<iostream>
#include<stdio.h>
#include<map>
#include<algorithm>
#include<stack>
#include<queue>
#include<string.h>
#include<string>
#include<stdlib.h>
#include<math.h>
#include<fstream>
#include<set>

using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
int xx[]={1,1,1,0,-1,-1,-1,0}; // 8 direction
int yy[]={-1,0,1,1,1,0,-1,-1}; // 8 direction
int rx[] = {1,-1,0,0}; // 4 direction
int ry[] = {0,0,1,-1}; // 4 direction
ll gcd(ll a,ll b)
{ return ((a%b==0)?b:gcd(b,a%b)) ;}
double pi = 2*acos(0.0);

int main()
{
     //freopen("0in.txt", "r", stdin);
    // freopen("0out.txt", "w", stdout);

    int tcase,t,i;
    double r,s;

    scanf("%d",&tcase);
    for(t=1;t<=tcase;t++)
    {
    	 cin>>r>>s;

    	 double c = acos((2*r*r - s*s)/(2*r*r));
    	 c = (180*c)/pi;
    	 if((int)c*100==9000)
    	 {
    	 	 printf("Yes\n");
		 }
		 else
		 {
		 	 printf("No\n");
		 }

	}

 return 0;
}