#include <iostream>
#include <string>
#include <vector>

using namespace std;

char chrArray[5][5];

int xAdjustment[8] = { -1, -1, -1, 0, 1, 1, 1, 0 };
int yAdjustment[8] = { -1, 0, 1, 1, 1, 0, -1, -1 };

bool hasWord(int x, int y, string word);

int main(){

    int nTestCase;
    int nFindCount;
    string strFindWord;
    bool bExist;
    bool flag;

    cin >> nTestCase;

    // input foundation
    for(int i = 0; i < 5; i++)
    for(int j = 0; j < 5; j++)
        cin >> chrArray[i][j];

    cin >> nFindCount;

    for(int h = 0; h < nFindCount; h++) {
        cin >> strFindWord;

        bExist = false;
        flag = false;

        for(int i = 0; i < 5; i++) {
            for(int j = 0; j < 5; j++)
            {
                if(hasWord(i, j, strFindWord)) {
                    bExist = true;
                    flag = true;
                }
                if(flag) break;
            }
            if(flag) break;
        }
        if(bExist) cout << strFindWord << " YES" << endl;
        else cout << strFindWord << " NO" << endl;
    }
} // main()

bool hasWord(int x, int y, string word) {
    pair<int, int> direction;
    vector< pair<int, int> > existDirection;

    if (x > 5 || x < 0 || y > 5 || y < 0)   return false; // 범위 초과
    if (chrArray[x][y] != word[0])          return false; // 첫글자 다름
    if (word.size() == 1)                   return true;  // 단어가 한글자일 때

    // 범위내, 첫글자가 같고, 글자수가 하나가 아닐때
    for (int i = 0; i < 8; i++) {
        // 다음 글자가 존재하는 방향을 저장
        if (chrArray[x + xAdjustment[i]][y + yAdjustment[i]] == word[1]) {
            direction.first = xAdjustment[i];
            direction.second = yAdjustment[i];
            existDirection.push_back(direction);
        }
    }
    // 다음글자가 존재하는 방향만 검사
    if (existDirection.size()) {
        for (vector< pair<int, int> >::iterator itr = existDirection.begin(); itr != existDirection.end(); itr++) {
            if (hasWord(x + (*itr).first, y + (*itr).second, word.substr(1))) return true;
        }
    }
    return false;
} // hasWord()