#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int SLen, TLen;
char S[500'010];
char T[500'010];

int nxt[500'010][2];

bool solve() {
  int i = 0;
  for (int j = 0; j < TLen; ++j) {
    i = nxt[i][(T[j] == 'L') ? 0 : 1] + 1;
    if (i > SLen) return false;
  }
  if (S[0] == 'L' && !(T[0] == 'L')) return false;
  if (S[SLen - 1] == 'R' && !(T[TLen - 1] == 'R')) return false;
  return true;
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%s", S);
    SLen = strlen(S);
    nxt[SLen][0] = SLen;
    nxt[SLen][1] = SLen;
    for (int i = SLen; --i >= 0; ) {
      nxt[i][0] = nxt[i + 1][0];
      nxt[i][1] = nxt[i + 1][1];
      nxt[i][(S[i] == 'L') ? 0 : 1] = i;
    }
    
    int Q;
    scanf("%d", &Q);
    for (; Q--; ) {
      scanf("%s", T);
      TLen = strlen(T);
      const bool ans = solve();
      puts(ans ? "YES" : "NO");
    }
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}