#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
int nxtL[N], nxtR[N];
void solve() {
    string s, t;
    cin >> s;
    int n = s.length(), q;
    int lstL = n, lstR = n;
    nxtL[n] = nxtR[n] = n;
    for (int i = n - 1; i >= 0; --i) {
        nxtL[i] = lstL, nxtR[i] = lstR;
        if (s[i] == 'L') lstL = i;
        else lstR = i;
    }
    cin >> q;
    while (q--) {
        cin >> t;
        int m = t.length();
        if (t[0] == 'R' && s[0] != 'R' || t[m - 1] == 'L' && s[n - 1] != 'L') {
            cout << "NO" << endl;
            continue;
        }
        int now = 0;
        if (t[0] == s[0]) now = 0;
        else now = t[0] == 'L' ? nxtL[0] : nxtR[0];
        for (int i = 1; i < m; ++i) {
            // cout << now << " " << i << endl;
            if (t[i] == 'L') now = nxtL[now];
            else now = nxtR[now];
        }
        if (now >= n) cout << "NO" << endl;
        else cout << "YES" << endl;
    }
}
int main() {
    cin.tie(nullptr) -> ios::sync_with_stdio(false);
    cout.tie(0);
    int T;
    cin >> T;
    while (T--) solve();
    return 0;
}