#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using namespace std;

using ll = long long;

int ctoi(char c) { return c == 'R'; }

void solve() {
    string S;
    cin >> S;

    int n = S.size();
    vector nxt(n + 1, vector<int>(3, n));
    for (int i = n - 1; i >= 0; i--) {
        nxt[i] = nxt[i + 1];
        nxt[i][ctoi(S[i])] = i;
        if (i > 0 and S[i] == 'R' and S[i - 1] == 'L') nxt[i][2] = i;
    }

    auto query = [&](const string& T) -> bool {
        if (S.front() == 'L' and T.front() != 'L') return false;
        if (S.back() == 'R' and T.back() != 'R') return false;
        int cur = 0;
        for (int i = 0; i < int(T.size()); i++) {
            if (i == 0 or T[i] == T[i - 1]) {
                cur = nxt[cur][ctoi(T[i])] + 1;
            } else {
                if (T[i] == 'R') {
                    cur = nxt[cur][2] + 1;
                } else {
                    cur = nxt[cur][ctoi(T[i])] + 1;
                }
            }
            if (cur > n) return false;
        }
        return true;
    };

    int q;
    cin >> q;
    for (; q--;) {
        string T;
        cin >> T;
        cout << (query(T) ? "YES" : "NO") << "\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int T;
    cin >> T;
    for (; T--;) solve();
    return 0;
}