#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

const int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
bool memoization[5][5][11];
char board[5][6];

bool hasWord(int x, int y, int count, const string& word);
bool inRange(int x, int y);

int main()
{
    int t, w_num;
    char tmp[11];
    scanf("%d", &t);
    for (int test = 0; test < t; test++) {
        for (int i = 0; i < 5; i++)
            scanf("%s", board[i]);
        scanf("%d", &w_num);
        for (int w = 0; w < w_num; w++) {
            scanf("%s", tmp);
            string word = tmp;
            memset(memoization, true, sizeof(memoization));
            bool found = false;
            for (int r = 0; r < 5; r++) {
                for (int c = 0; c < 5; c++) {
                    if (hasWord(r, c, 0, word)) {
                        found = true;
                        break;
                    }
                }
                if (found)
                    break;
            }
            if (found)
                printf("%s YES\n", tmp);
            else
                printf("%s NO\n", tmp);
        }
    }
}

bool hasWord(int x, int y, int count, const string& word)
{
    bool ret;
    if (!inRange(x, y))
        return false;
    if (!memoization[x][y][count])
        return false;
    if (word[count] != board[x][y]) {
        // memoization[x][y][count] = false;
        return false;
    }
    if (count+1 == word.length())
        return true;
    for (int dir = 0; dir < 8; dir++) {
        int nx = x + dx[dir], ny = y + dy[dir];
        if (hasWord(nx, ny, count+1, word))
            ret = true;
    }
    if (!ret) {
        memoization[x][y][count] = false;
        return false;
    }
    return true;
}

bool inRange(int x, int y)
{
    if (x < 0 || x >= 5 || y < 0 || y >= 5)
        return false;
    else
        return true;
}