#include <bits/stdc++.h>
using namespace std;
const long long MOD1 = 1000000007;
const long long MOD2 = 998242353;
typedef pair<long long, long long> P;
#define logn long
#define lnog long
#define itn int
void input_vecp(vector<P>&A) {
	/*for (long long i = 0; i < A.size(); i++) {
		cin >> A.at(i).first >> A.at(i).second;
	}*/
	for (long long i = 0; i < A.size(); i++) {
		cin >> A.at(i).first;
	}
	for (long long i = 0; i < A.size(); i++) {
		cin >> A.at(i).second;
	}
}
int pos(string S) {
	if (S == "WA") return 1;
	if (S == "TLE") return 2;
	if (S == "MLE") return 3;
	if (S == "OLE") return 4;
	if (S == "RE") return 5;
	else return 0;
}
int main() {
	long long N; cin >> N;
	vector<P>cases(6);
	for (long long i = 0; i < N; i++) {
		input_vecp(cases);
		string S; cin >> S;
		long long k = pos(S);
		if (cases.at(k).first != 0) {
			cout << "No" << endl;
		}
		else {
			long long num = 0;
			bool check = true;
			for (long long j = 0; j < 6; j++) {
				if (j == 0 || j == k) continue;
				if (cases.at(j).second != 0) {
					cout << "No" << endl;
					check = false;
					break;
				}
			}
			if (check) cout << "Yes" << endl;
		}
	}
}