# include <bits/stdc++.h>
# define imax(a , b) ((a) > (b) ? (a) : (b))
# define imin(a , b) ((a) < (b) ? (a) : (b))
# define rl ro << 1
# define rr ro << 1 | 1
using namespace std;
const int N = 1e6 + 511;
int ne[N][10];
void solve()
{
    string s;
    cin >> s;
    int n = s.size();
    s = " " + s;

    for (int i = 0; i <= n; ++i) ne[i][0] = ne[i][1] = -1;

    int l = 0 , r = 0;
    for (int i = 0; i <= n; ++i){
        while (l <= n && (l <= i || s[l] != 'L')) ++l;
        while (r <= n && (r <= i || s[r] != 'R')) ++r;
        if (l <= n) ne[i][0] = l;
        if (r <= n) ne[i][1] = r;
    }

    int q;
    cin >> q;
    while (q--){
        string t;
        cin >> t;
        int m = t.size();
        t = " " + t;
        
        if (t[1] == 'R' && s[1] == 'L') {
            cout << "NO\n";
            continue;
        } 

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

        int la = 0 , F = 0;
        for (int i = 1; i <= m; ++i){
            int fl = 0;
            la = ne[la][(t[i] == 'R')];
            if (la == -1) { F = 1; break; }
        }
        cout << (F ? "NO" : "YES") << "\n";
    }
}
signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    cin>>T;
    while (T--) solve();
}