#include<iostream>
#include<unordered_map>
#include<vector>
#include<algorithm>
#include<string>
#include<math.h>
#include<map>
#include<set>
#include<string.h>
#include<iomanip>
#include<queue>
using namespace std;
const int N = 200015;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
//int mod = 998244353;

//int a[N]{};
int f1[200005]{};
int f2[200005]{};
string ans = "harbin";
vector<string> s(7);
int ss[10][10]{};
int p = 0;
int vis[7]{};
void dfs(int n,int num)
{
	if (n == 6)
	{
		if (num == 6) p = 1;
		return;
	}
	for (int i = 0; i < 6; i++)
	{
		if (!vis[i])
		{
			vis[i] = 1;
			if (ss[n][i] == 1)
				dfs(n + 1, num + 1);
			else dfs(n + 1, num);
			vis[i] = 0;
		}
	}
}


int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		for (int i = 0; i <= 6; i++)
			for (int j = 0; j <= 6; j++)
				ss[i][j] = 0;

		for (int i = 0; i < 6; i++)
		{
			cin >> s[i];

			for (int k = 0; k < s[i].size(); k++)
			{
				for (int p = 0; p < 6; p++)
				{
					if (ans[p] == s[i][k]) ss[i][p] = 1;
				}
			}
		}
		int flag = 0;
		
		
		dfs(0,0);
		

		if (p) cout << "Yes" << endl;
		else cout << "No" << endl;
	}

}