//by 72
#include<bits/stdc++.h>
#define pii pair<int, int>
#define F(i, a, b) for(int i = (a); i <= (b); i ++)
#define Fd(i, a, b) for(int i = (a); i >= (b); i --)
using namespace std;

template <typename T1, typename T2>
ostream& operator <<(ostream& out, pair<T1, T2> p) {
    out << '(' << p.first << ", " << p.second << ')';
    return out;
}
template <typename T>
ostream& operator <<(ostream& out, vector<T> v) {
    cout << '[';
    if (!v.empty()) cout << v[0];
    for (int i = 1; i < (int)v.size(); i++) cout << ", " << v[i];
    cout << ']';
    return out;
}

typedef long long ll;
const int mod = 998244353;
const int inf = 1e9;
const bool test = 0;

void sol() {
    string s; cin >> s; 
    int n = s.size(); s = " " + s;
    vector nxt(2, vector<int> (n + 1));
    vector<int> now(2);
    F(i, 0, 1) now[i] = n + 1;
    Fd(i, n, 0) {
        F(j, 0, 1) nxt[j][i] = now[j];
        int t = s[i] == 'L' ? 0 : 1;
        now[t] = i;
    }
    int m; cin >> m;
    F(i, 1, m) {
        if(test) {
            // cout << i << endl;

            cout << "i = " << i << endl;
        }
        string t; cin >> t;
        int ok = 1, st = 0;
        if(s[1] == 'L' && t[0] != 'L') ok = 0;
        if(s[n] == 'R' && t[t.size() - 1] != 'R') ok = 0;
        for(auto x : t) if(ok) {
            // cout << "st = " << st << endl;
            int t = x == 'L' ? 0 : 1;
            st = nxt[t][st];
            if(st == n + 1) {
                ok = 0;
                break;
            }
        }
        if(ok) cout << "YES\n";
        else cout << "NO\n";
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    cin >> t;
    F(i, 1, t) sol();
    return 0;
}
//2011810514 suki
/*
2
RRLLRRLL
4
LLLLL
LLR
LRLR
R
RLLLLLL
3
LLLLL
RL
RRL
*/