#include <bits/stdc++.h>

using namespace std;

using i64 = long long;
using i128 = __int128;
using ull = unsigned long long;
#define pll pair<ll, ll>
#define pii pair<int, int>
#define vi vector<int>
#define fir(i, a, b) for (int i = a; i <= b; i++)
#define pqi priority_queue<int> // 优先队列

#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define int long long

void solve()
{
    std::string s[6];

    bool con[6][26]{};
    for (int i = 0; i < 6; i++)
    {
        std::cin >> s[i];
        for (auto x : s[i])
        {
            con[i][x - 'a'] = true;
        }
    }

    std::string t = "harbin";
    std::sort(all(t));

    bool ans = false;
    do
    {
        bool ok = true;
        for (int i = 0; i < 6;i++)
        {
            if (!con[i][t[i] - 'a'])
            {
                ok = false;
            }
        }
        if (ok)
        {
            ans = true;
            break;
        }
    }while (std::next_permutation(all(t)));

    std::cout << (ans ? "Yes" : "No") << "\n";
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t;
    std::cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}