#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl '\n'
#define yes cout << "YES" << endl
#define no cout << "No" << endl
const int MAX = 1e5 + 5, mod = 998244353;
const int N = 750;

void solve(){
    string s;
    cin >> s;
    int n = s.size();
    s = ' ' + s;
    vector<int> pre(n + 1, 0);
    for (int i = 1; i <= n; i ++){
        pre[i] = pre[i - 1] + (s[i] == 'L');
    }
    auto solve1 = [&](string t){
        int m = t.size();
        t = ' ' + t;
        if (s[1] == 'L' and t[1] == 'R') return false;
        if (s[n] == 'R' and t[m] == 'L') return false;
        int cur = 1;
        for (int i = 1; i <= n; i ++){
            if (s[i] == t[cur]) cur ++;
            if (cur > m) return true;
        }
        return false;
    };
    auto solve2 = [&](string t){
        int m = t.size();
        if (s[1] == 'L' and t[1] == 'R') return false;
        if (s[n] == 'R' and t[m] == 'L') return false;
        vector<array<int, 2>> a;
        int cnt = 1;
        for (int i = 1; i < m; i ++){
            if (t[i] == t[i - 1]) cnt ++;
            else{
                a.push_back({t[i - 1] == 'L', cnt});
                cnt = 1;
            }
        }
        a.push_back({t[m - 1] == 'L', cnt});
        int cur = 0;
        for (auto [x, y] : a){
            if (x == 0){
                int lk = cur, rk = n;
                while (lk < rk){
                    int mid = (lk + rk) >> 1;
                    if ((mid - pre[mid]) - (cur - pre[cur]) >= y) rk = mid;
                    else lk = mid + 1;
                }
                // cerr << lk << ' ';
                if ((lk - pre[lk]) - (cur - pre[cur]) < y) return false;
                cur = lk;
            }
            else{
                int lk = cur, rk = n;
                while (lk < rk){
                    int mid = (lk + rk) >> 1;
                    if (pre[mid] - pre[cur] >= y) rk = mid;
                    else lk = mid + 1;
                }
                // cerr << lk << ' ';
                if (pre[lk] - pre[cur] < y) return false;
                cur = lk;
            }
            
        }
        return true;
    };
    int q; cin >> q;
    for (int i = 0; i < q; i ++){
        string t; cin >> t;
        bool ans;
        if (t.size() > N) ans = solve1(t);
        else ans = solve2(t);
        if (ans) cout << "YES" << endl;
        else cout << "NO" << endl;
    }
}
signed main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int T=1;cin>>T;while(T--)
    solve();
}