#include <stdio.h>
#include <iostream>
#include <string>
#include <string.h>

using namespace std;

int convert_numberInTextform_to_arabicNumber(string);
int string_arithmaticOperator_solver(int, int,string);

int main(){
    int T;
    cin >> T;   // 몇 줄 받을지 입력받음.
    for (int i = 0; i < T; i++){
        string A, B, C, formula, arithmaticOperator;

        do{
            cin.clear();
            cin.ignore(cin.rdbuf()->in_avail());
        } while (cin.fail());   //cin 버퍼의 \n제거용.


        getline(cin,formula);   //답안 입력받음.
        if (formula == ""){
            cout << "No" << endl;
            continue;
        }

        int a=formula.find(" ");
        A = formula.substr(0, a);

        arithmaticOperator = formula.substr(a + 1,1);

        int b = formula.find("=");
        B = formula.substr(a + 3, b-a-4);

        C = formula.substr(b + 2);

        //ex) A : two, B : three, C=ivfe
        //arithmaticOperator = "+"
        //아래는 문자열로 입력된 숫자를 정수형으로 바꿔주고 정수형으로 답안을 비교하는 코드입니다.
        int correct_answer = string_arithmaticOperator_solver(convert_numberInTextform_to_arabicNumber(A), convert_numberInTextform_to_arabicNumber(B), arithmaticOperator);
        int answer = convert_numberInTextform_to_arabicNumber(C);

        if (answer == correct_answer && correct_answer!=-1 && answer!=-1){
            cout << "Yes" << endl;
        }
        else{
            cout << "No" << endl;
        }
    }
    return 0;
}
//"+"를 연산해주는 함수
int string_arithmaticOperator_solver(int a, int b,string str){
    if (str.compare("+")==0){
        return a + b;
    }
    else if (str.compare("-")==0){
        return a - b;
    }
    else if (str.compare("*")==0){
        return a*b;
    }
    else{
        return -1;
    }
}
//버블정렬로 입력문자 재정렬 뒤 비교
int convert_numberInTextform_to_arabicNumber(string a){
    for (int i = a.length(); i>0; i--){
        for (int j = 0; j < i-1; j++){
            if (strcmp(&(a.at(j)), &(a.at(j + 1))) > 0){
                char tmp = NULL;
                tmp = a.at(j);
                a.at(j) = a.at(j + 1);
                a.at(j + 1) = tmp;
            }
        }
    }
    if (a.compare("eorz")==0){
        return 0;
    }
    else if (a.compare("eno") == 0){
        return 1;
    }
    else if (a.compare("otw") == 0){
        return 2;
    }
    else if (a.compare("eehrt") == 0){
        return 3;
    }
    else if (a.compare("foru") == 0){
        return 4;
    }
    else if (a.compare("efiv") == 0){
        return 5;
    }
    else if (a.compare("isx") == 0){
        return 6;
    }
    else if (a.compare("eensv") == 0){
        return 7;
    }
    else if (a.compare("eghit") == 0){
        return 8;
    }
    else if (a.compare("einn") == 0){
        return 9;
    }
    else if (a.compare("ent") == 0){
        return 10;
    }
    else{
        return -1;
    }
}