#include <bits/stdc++.h>
using namespace std;
static inline void canhazfast() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
}
template <typename T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T>
T extgcd(T a, T b, T &x, T &y) {
  T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
  while (b) {
    T q = a / b;
    a %= b;
    swap(a, b);
    x0 -= q * x1;
    swap(x0, x1);
    y0 -= q * y1;
    swap(y0, y1);
  }
  x = x0;
  y = y0;
  return a;
}
static inline int ctz(unsigned x) { return __builtin_ctz(x); }
static inline int ctzll(unsigned long long x) { return __builtin_ctzll(x); }
static inline int clz(unsigned x) { return __builtin_clz(x); }
static inline int clzll(unsigned long long x) { return __builtin_clzll(x); }
static inline int popcnt(unsigned x) { return __builtin_popcount(x); }
static inline int popcntll(unsigned long long x) {
  return __builtin_popcountll(x);
}
static inline int bsr(unsigned x) { return 31 ^ clz(x); }
static inline int bsrll(unsigned long long x) { return 63 ^ clzll(x); }
bool good[64];
char s[100064], t[100064];
bool match(const char a[], const char b[], int n) {
  for (int i = 0; i < n; ++i) {
    if (a[i] == b[i]) continue;
    if (a[i] != '?' || !good[b[i] - 'a']) return false;
  }
  return true;
}
bool check(const char a[], int n) {
  for (int i = 0; i < n; ++i)
    if (good[a[i] - 'a']) return false;
  return true;
}
int main() {
  canhazfast();
  int n, m, q, p;
  cin >> s;
  for (int i = 0; s[i]; ++i) good[s[i] - 'a'] = true;
  cin >> s >> q;
  n = strlen(s);
  p = find(s, s + n, '*') - s;
  for (; q; --q) {
    bool res;
    cin >> t;
    m = strlen(t);
    if (p == n) {
      res = m == n && match(s, t, n);
    } else {
      int x = p, y = n - p - 1;
      res = m >= n - 1 && match(s, t, x) && match(s + n - y, t + m - y, y) &&
            check(t + p, m - n + 1);
    }
    cout << (res ? "YES\n" : "NO\n");
  }
  return 0;
}
