# 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 = 2e5 + 511;
vector<int> e[10];
void solve()
{
    string s;
    cin >> s;
    // for (int i = 1; i <= (1e6 )/ 2; ++i) s += 'R';
    // for (int i = 1; i <= (1e6 )/ 2; ++i) s += 'L';
    int n = s.size();
    s = " " + s;
    for (int i = 0; i < 2; ++i) e[i].clear();
    for (int i = 1; i <= n; ++i){
        if (s[i] == 'L') e[0].push_back(i);
                    else e[1].push_back(i);
    }

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

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

        int la = 0 , F = 0;
        for (int i = 1; i <= m; ++i){
            int fl = 0;
            if (la == n) {F = 1; break; } 
            int pos = (t[i] == 'R');
            auto x = lower_bound(e[pos].begin() , e[pos].end() , la + 1);
            if (x == e[pos].end()) {F = 1; break; } 
            la = *x;
        }

        cout << (F ? "NO" : "YES") << "\n";
 
    }
}
signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    cin>>T;
    while (T--) solve();
}