F. Fixing Banners

// Problem: F. Fixing Banners
// Contest: Codeforces - The 2019 China Collegiate Programming Contest Harbin Site
// URL: https://codeforces.com/gym/102394/problem/F
// Memory Limit: 512 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<iostream>
#include<cstdio>
#include<string>
#include<ctime>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<stack>
#include<climits>
#include<queue>
#include<map>
#include<set>
#include<sstream>
#include<cassert>
#include<bitset>
#include<list>
#include<unordered_map>
#define ios std::ios::sync_with_stdio(false),std::cin.tie(0),std::cout.tie(0)
using namespace std;
#define ff first
#define ss second
// #define lowbit(x) (x&-x)
#define pf(a) printf("%d\n",a)
#define mem(x,y) memset(x,y,sizeof(x))

#define dbg(x) cout << #x << " = " << x << endl
#define rep(i,l,r) for(int i = l; i <= r; i++)
#define fep(i,a,b) for(int i=b; i>=a; --i)

typedef long long ll;

int n, m;
int a[10][10];
bool flag;
int vis[10];
void dfs(int i) { // i 的意思是搜到了
	if(i == 7) { // 如果6个字母都枚举完了，那么可以返回答案。
		flag = true;
		return ;
	}
	else {
		rep(k,1,6) { //
			if(!vis[k] && a[i][k]==1) { // 相应的字母没有出现，并且当前位置有相应的字母
				vis[k] = 1; // 选择相应的字母，而且这一行不能再选择了
				dfs(i+1); // 进行下一个字母的枚举
				vis[k] = 0;
			}
		}
	}
	return;
}


void solve()
{
	mem(a,0);
	mem(vis,0);
	rep(i,1,6) {
		string s;
		cin >> s;
		rep(j,0,s.size()-1) {
			if(s[j]=='h') a[i][1] = 1;
			if(s[j]=='a') a[i][2] = 1;
			if(s[j]=='r') a[i][3] = 1;
			if(s[j]=='b') a[i][4] = 1;
			if(s[j]=='i') a[i][5] = 1;
			if(s[j]=='n') a[i][6] = 1;
		}
	}
	flag = false;
	dfs(1);
	if(flag) printf("Yes\n");
	else printf("No\n");

}

int main()
{
	//ios; // 开启同步
	int Case; scanf("%d", &Case);
	while(Case--)
		solve();
	return 0;
}