#include <bits/stdc++.h>

using namespace std;

#define vc vector
#define pii pair <int, int>
#define int long long
using ld = long double;
using ll = long long;
const int inf = 1e9;


template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

string w = "harbin";

void solve_case() {
    vector<string> a(6);
    for (auto &i : a) cin >> i;
    vector<vector<bool>> ok(6, vector<bool>(26));
    for (int i = 0; i < 6; ++i) {
        for (auto &x : a[i]) ok[i][x - 'a'] = 1;
    }
    sort(ok.begin(), ok.end());
    bool s = false;
    do {
        bool q = true;
        for (int i = 0; i < 6; ++i) {
            if (!ok[i][w[i] - 'a']) q = false;
        }
        s |= q;
    } while (next_permutation(ok.begin(), ok.end()));
    cout << (s ? "Yes" : "No") << '\n';
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T; cin >> T;
    while (T--) solve_case();
}