#include <bits/stdc++.h>
void Yes() { std::cout << "Yes" << "\n"; return; }
void No() { std::cout << "No" << "\n"; return; }
template <typename T>
void out(T x) { std::cout << x << "\n"; }
using namespace std;
using ll=long long;
using PII=pair<int,int>;

const int N=2e5+10;
string s[6];
map<char,bool>mp[6];
void Solve()
{
    char a[6] = {'h','a','r','b','i','n'};
    for(int i = 0;i<6;i++) {
        mp[i].clear();
        cin >> s[i];
        for(char p:s[i]) {
            mp[i][p] = true;
        }
    }

    do{
        int num = 0;
        for(int i = 0 ; i < 6 ; i++ ) {
            if(mp[i].count(a[i]) && mp[i][a[i]] == 1)
                num++;
        }
        if(num == 6) {
            Yes();
            return;
        }
    }while(next_permutation(a,a+6));
    No();

}
signed main()
{
    int t=1;
    cin>>t;
    while(t--)
    Solve();
}