#include<bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;

cs int N = 1e6 + 5; 
string S, T; 
int n; 
int nxt[N][52];
int id(char c) {
    return ('a' <= c && c <= 'z') ? c - 'a' : c - 'A' + 26; 
}
int main() {
    #ifdef zqj
    freopen("1.in","r",stdin);
    #endif
    ios :: sync_with_stdio(0), cin.tie(0);
    cin >> S; 
    cin >> n;
    int m = S.length();
    for(int i = 0; i < m; i++)
        if(i & 1 ^ 1){
            if('a' <= S[i] && S[i] <= 'z') S[i] = S[i] - 'a' + 'A';
            else S[i] = S[i] - 'A' + 'a';
        }
    vector <int> c(52, m);
    for(int i = m - 1; i >= 0; i--){
        int t = id(S[i]);
        c[t] = i;  
        for(int j = 0; j < 52; j++) nxt[i][j] = c[j];
    }
    for(int i = 1; i <= n; i++) {
        cin >> T;
        int k = T.length();
        for(int i = 0; i < k; i++)
            if(i & 1 ^ 1){
                if('a' <= T[i] && T[i] <= 'z') T[i] = T[i] - 'a' + 'A';
                else T[i] = T[i] - 'A' + 'a';
            }
        int cur = 0; 
        for(int i = 0;i  < k; i++) { 
            // cout << T[i] <<' ' << id(T[i]) << endl;
            cur = nxt[cur][id(T[i])];
            if(cur >= m) break;
        }
        if(cur < m) {
            cout << "YES\n";
        }
        else {
            cout << "NO\n";
        }
    }
}