#include <cstdio>
#include <string.h>
int T;
char map[15][15];
char word[20];
int chk[15][15][15];
int dirow[] = { -1, -1, -1, 0, 1, 1, 1, 0 };
int dicol[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
int flag;
int cnt;
inline int strlen(char *p)
{
    int cnt = 0;
    while (p[cnt++]);
    return cnt-1;
}
int DFS(int n, int row, int col)
{
    if (n >= cnt - 1) return 1;
    chk[n][row][col] = 1;
    if (word[n] != map[row][col]) return 0;
    for (register int i = 0; i < 8; i++)
    {
        int ni = row + dirow[i]; int nj = col + dicol[i];
        if (ni < 0 || ni > 4 || nj < 0 || nj > 4) continue;
        if (chk[n+1][ni][nj]) continue;
        if (DFS(n + 1, ni, nj) == 1) return 1;
    }
    return 0;
}


int main(void)
{
    register int i, j;
    int row, col;
    int n;
    scanf("%d", &T);
    while (T--)
    {
        memset(map, 0, sizeof(map));
        for (i = 0; i < 5; i++) scanf("%s", map[i]);
        scanf("%d", &n);
        for (i = 0; i < n; i++)
        {
            flag = 0;
            cnt = 0;
            memset(chk, 0, sizeof(chk));
            scanf("%s", word);
            cnt = strlen(word);
            printf("%s ", word);
            for (row = 0; row < 5; row++)
            {
                for (col = 0; map[row][col]; col++)
                {
                    if (DFS(0, row, col) == 1)
                    {
                        flag = 1;
                        break;
                    }
                }
                if (flag) break;
            }
            if(flag) puts("YES");
            else puts("NO");
        }
    }
    return 0;
}