#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
using namespace std;

void testcase(){
    string A; cin >> A;
    int N = A.size();
    vector<int> nxL(N+1,N), nxR(N+1,N);
    for(int i=N-1; i>=0; i--){
        nxL[i] = nxL[i+1];
        nxR[i] = nxR[i+1];
        if(A[i] == 'L') nxL[i] = i;
        if(A[i] == 'R') nxR[i] = i;
    }
    int Q; cin >> Q;
    rep(qi,Q){
        string X; cin >> X;
        if(A[0] == 'L' && X[0] == 'R'){ cout << "NO\n"; continue; }
        if(A.back() == 'R' && X.back() == 'L'){ cout << "NO\n"; continue; }
        int p = 0;
        bool ans = true;
        for(char c : X){
            if(c == 'L') p = nxL[p] + 1;
            else p = nxR[p] + 1;
            if(p == N+1){ ans = false; break; }
        }
        cout << (ans ? "YES\n" : "NO\n");
    }
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int T; cin >> T;
    rep(t,T) testcase();
    return 0;
}