#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<time.h>

 using namespace std;

 int const N = ;

 int hash[N];

 char exp1[N],exp2[N],a1[N],a2[N],stack1[N];

 int stack2[N];

 int cal(char exp[],char a[],int len,char stack[])

 {

      int topa=,tops=;

      for(int i=;i<len;i++)

      {

          if((exp[i]<=''&&exp[i]>='')||(exp[i]<='Z'&&exp[i]>='A')||(exp[i]<='z'&&exp[i]>='a'))

          a[topa++]=exp[i];

          else

          {

            if(exp[i]=='+'||exp[i]=='-')

            {

               while(tops>&&stack[tops-]!='(')

                     a[topa++]=stack[--tops];

               stack[tops++]=exp[i];

            }

            else

              if(exp[i]=='*')

              {

                 while(tops>&&stack[tops-]!='('&&stack[tops-]!='+'&&stack[tops-]!='-')

                       a[topa++]=stack[--tops];

                 stack[tops++]=exp[i];

              }

              else

                if(exp[i]==')')

                {

                   while(stack[tops-]!='(')

                         a[topa++]=stack[--tops];

                   tops--;

                }

                else

                  if(exp[i]=='(')

                     stack[tops++]=exp[i];

          }

      }

      while(tops>)

            a[topa++]=stack[--tops];

      return topa;

 }

 int Count(char a[],int len,int stack[])

 {

     int tops=;

     for(int i=;i<len;i++)

     {

         if(a[i]>=''&&a[i]<='')

            stack[tops++]=a[i]-'';

         else

           if((a[i]>='A'&&a[i]<='Z')||(a[i]>='a'&&a[i]<='z'))

              stack[tops++]=hash[a[i]];

           else

           {

              if(a[i]=='*')

                 stack[tops-]=stack[tops-]*stack[tops-];

              else

                if(a[i]=='-')

                 stack[tops-]=stack[tops-]-stack[tops-];

                else

                  if(a[i]=='+')

                     stack[tops-]=stack[tops-]+stack[tops-];

              tops--;

           }

     }

     return stack[];

 }

 int main()

 {

     srand(time());

     int T;

     cin>>T;

     gets(exp1);

     while(T--)

     {

           gets(exp1);

           gets(exp2);

           int len1=strlen(exp1);

           int len2=strlen(exp2);

           len1=cal(exp1,a1,len1,stack1);

           len2=cal(exp2,a2,len2,stack1);

           int f=;

           for(int i=;i<;i++)

           {

               for(int j=;j<;j++)

                   hash[j]=rand()%;

               int ans1=Count(a1,len1,stack2);

               int ans2=Count(a2,len2,stack2);

               if(ans1!=ans2)

               {

                  f=;break;

               }

           }

           if(f)printf("YES\n");

           else printf("NO\n");

     }

     return ;

 }