#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define pb emplace_back
#define fi first
#define se second
using vi=vector<int>;
using pi=pair<int,int>;

void solve(){
	string s; cin>>s;
	int n=s.size();
	vector< array<int,3> > nxt(n+1, {n, n, n});
	per(i,n-1,0){
		nxt[i]=nxt[i+1];
		if(s[i]=='L'){
			nxt[i][0]=i;
		}
		if(s[i]=='R'){
			nxt[i][1]=i;
		}
		if(i<n-1 && s[i]=='L' && s[i+1]=='R'){
			nxt[i][2]=i;
		}
	}
	int q; cin>>q;
	rep(_,1,q){
		string t; cin>>t;
		if(t[0]=='R' && s[0]!='R'){
			cout<< "NO\n";
			continue;
		}
		if(t.back()=='L' && s.back()!='L'){
			cout<< "NO\n";
			continue;
		}

		int pos=-1;
		rep(i,0,(int)t.size()-1){
			if(i<(int)t.size()-1 && t[i]=='L' && t[i+1]=='R'){
				pos=nxt[pos+1][2]+1;
				i++;
			}
			else if(t[i]=='L'){
				pos=nxt[pos+1][0];
			}
			else if(t[i]=='R'){
				pos=nxt[pos+1][1];
			}
			if(pos>=n){
				break;
			}
		}
		cout<< (pos<n? "YES": "NO") <<'\n';
	}
}
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);
	#ifndef ONLINE_JUDGE
	assert(freopen(".in","r",stdin));
	assert(freopen(".out","w",stdout));
	#endif
	
	int t; cin>>t;
	while(t--){
		solve();
	}
}