#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int Q; cin >> Q;
  while(Q--){
    vector<int> a(6),b(6);
    rep(i,6) cin >> a[i];
    rep(i,6) cin >> b[i];
    int x;
    string X; cin >> X;
    if(X=="WA") x=1;
    if(X=="TLE") x=2;
    if(X=="MLE") x=3;
    if(X=="OLE") x=4;
    if(X=="RE") x=5;
    int ok = 1;
    for(int i=1;i<6;i++){
      if(x==i) continue;
      if(b[i]!=0) ok=0;
    }
    if(a[0]<b[0]) ok=0;
    if(a[x]) ok=0;
    if(ok) cout << "Yes" << endl;
    else cout << "No" << endl;
  }
  return 0;
}