#include <bits/stdc++.h>
using namespace std;
using namespace chrono;

using ll = long long;
using ull = unsigned long long;

string to_string(const string &s) {
  return '"' + s + '"';
}

string to_string(bool b) {
  return b ? "true" : "false";
}

template <typename A, typename B>
string to_string(const pair<A, B> &p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename T>
string to_string(const T &v) {
  string s = "{";
  bool first = true;
  for (const auto &it : v) {
    if (!first)
      s += ", ";
    else
      first = false;
    s += to_string(it);
  }
  return s += "}";
}

void debug_out() {
  cerr << endl;
}

template <typename T, typename... Args>
void debug_out(const T &first, const Args&... rest) {
  cerr << to_string(first) << " ";
  debug_out(rest...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

auto startTime = high_resolution_clock::now();
int get_time() {
  auto stopTime = chrono::high_resolution_clock::now();
  auto duration = duration_cast<milliseconds>(stopTime - startTime);
  return duration.count(); // in ms
}

int get_val(char ch) {
    return (ch == 'L') ? 0 : 1;
}

void solve() {
  string s;
  int n;
  cin >> s;

  vector<vector<int>> nxt(s.size(), vector<int>(2, -1));
  for (int i = s.size() - 1; i >= 0; --i) {
    if (i + 1 < s.size()) {
      nxt[i][0] = nxt[i + 1][0];
      nxt[i][1] = nxt[i + 1][1];

      int val = (s[i + 1] == 'L') ? 0 : 1;
      nxt[i][val] = i + 1;
    }
  //  debug(i, nxt[i][0], nxt[i][1]);
  }

  cin >> n;
  for (int i = 1; i <= n; ++i) {
    bool ok = true;
    string s2;
    cin >> s2;

    if (s2[0] == 'R' && s[0] == 'L') {
      cout << "NO\n";
      continue;
    }

    int p = 0, j = 0;
    if (s2[0] == s[0]) {
      p = 0;
    } else {
      p = nxt[0][get_val(s2[0])];
      if (p < 0) {
        cout << "NO";
        continue;
      }
    }
    j = 1;

    while (j < s2.size()) {
      p = nxt[p][get_val(s2[j])];
      if (p < 0) {
        ok = false;
        break;
      }
      ++j;
    }
    cout << (ok ? "YES" : "NO") << "\n";
  }

}

int main() {
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);

  int t = 1;
  cin >> t;
  while (t--)
    solve();

  return 0;
}