// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2")
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define ull unsigned long long
//#define int long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	return f?-x:x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 2000005
#define inf 0x3f3f3f3f

string s,t;
int n;
int nxt[maxn][2];
bool chk(){
	if(s[0]=='L' && t[0]!='L')return 0;
	if(s[n-1]=='R' &&  t.back()!='R')return 0;
	int p=0;
	for(auto ch:t){
		p=nxt[p][ch=='R'];
		if(p>=n) return 0;
		++p;
	}
	return 1;
}
void work()
{
	cin>>s;
	n=s.size();
	nxt[n][0]=nxt[n][1]=n;
	Rep(i,n-1,0){
		For(j,0,1)nxt[i][j]=nxt[i+1][j];
		nxt[i][s[i]=='R']=i;
	}
	int m=read();
	while(m--){
		cin>>t;
		if(chk()) puts("YES");
		else puts("NO");
	}
}

signed main()
{
	int T=read();
	while(T--)work();
	return 0;
}
/*

*/