#include<stdio.h>
#include<string.h>
int len; char data[8][8];
int min(int x, int y)
{
    return x<y?x:y;
}
int max(int x, int y)
{
    return x>y?x:y;
}
bool find(char *question, int level, int x, int y)
{
    if (level==len) return true;
    if (level==0) {
        for (int i=0; i<5; i++)
            for (int j=0; j<5; j++)
                if (data[i][j]==question[0]) return find(question, 1, i, j);
    }
    else {
        for (int i=max(0,x-1); i<=min(4,x+1); i++)
            for (int j=max(0,y-1); j<=min(4,y+1); j++)
                if (data[i][j]==question[level]&&(i!=x||j!=y)) return find(question, level+1, i, j);
    }
    return false;
}
int main()
{
    int testCase; scanf("%d", &testCase);
    while(testCase--)
    {
        for (int i=0; i<5; i++) scanf("%s", data[i]);
        int num; scanf("%d", &num);
        char question[15];
        for (int i=0; i<num; i++) {
            scanf("%s", question);
            len=strlen(question);
            if (find(question, 0, 0, 0)) printf("%s YES\n", question);
            else printf("%s NO\n", question);
        }
    }
    return 0;
}