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

using ll = long long;
using ld = long double;

#define all(a) begin(a), end(a)
#define len(a) int((a).size())

int id(char c) {
    return c == 'L' ? 0 : 1;
}

void solve(int /* test_num */) {
    string s;
    cin >> s;
    array<vector<int>, 2> pos;
    for (int i = 0; i < len(s); i++) {
        pos[id(s[i])].push_back(i);
    }
    pos[0].push_back(len(s));
    pos[1].push_back(len(s));

    int q;
    cin >> q;
    while (q--) {
        string t;
        cin >> t;

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

        int i = 0;
        for (auto c : t) {
            i = *lower_bound(all(pos[id(c)]), i) + 1;
            if (i > len(s)) {
                break;
            }
        }
        cout << (i <= len(s) ? "YES" : "NO") << '\n';
    }
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int tests;
    cin >> tests;
    for (int test_num = 1; test_num <= tests; test_num++) {
        solve(test_num);
    }
}