#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define fi first
#define se second
#define PII pair<int,int>
namespace IO {
    #define gh getchar
    inline int read(){char ch=gh();int x=0;bool t=0;while(ch<'0'||ch>'9')   t|=ch=='-',ch=gh();while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=gh();return t?-x:x;}
    inline char getc(){char ch=gh();while(ch<'a'||ch>'z') ch=gh();return ch;}
    inline void write(int x){if(x < 0){putchar('-');x = -x;}if(x > 9){write(x / 10);}putchar((x % 10 + '0'));}
}
using namespace IO;
using namespace std;
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else                                               
	#define gdb(...) void()
	#endif
}using namespace Debug;
const int Maxn = 1000010, mod = 1e9 + 7;
string a="harbin";
int p[Maxn];
void work(){
    int n = 6;
    string s[7];
    int cnt = 0;
    int fl = 0;
    for(int i = 1; i <= 6; i++) cin >> s[i];
    for(int i = 1; i <= 6; i++) p[i] = i;
    do{ 
        int tp = 1;
        for(int i = 1; i <= n; i++){
            int find = 0;
            for(int j = 0; j < s[i].size(); j++){
                if(s[i][j] == a[p[i]]) find = 1;
            }
            if(!find) tp = 0;
        }
        if(tp == 1){
            puts("Yes"); return ;
        }
    }while(next_permutation(p + 1, p + 7));
    puts("No");
    return ;
}
signed main(){
    a = ' ' + a;
    int t = read();
    while(t--){
        work();
    }
}