#include <iostream>
#include <cstdio>
#include <vector>
#define N 500005
using namespace std;
struct stru
{
	int id,len;
};
vector <stru> sv[N],strv;
int cnt[N],pre[N],nxt[N],c[N],T,n,cnt_,fll,flr;
bool flL[N],flR[N];
string str;
signed main ()
{ 
//	freopen("HKK.in","r",stdin);
	cin>>T;
	while (T--)
	{
		cin>>str;
		str+='#';
		strv.clear();
		cnt_=1;
		for (int i=1; i<str.size(); i++)
			if (str[i-1]!=str[i])
			{
				strv.push_back((stru){(str[i-1]=='R'),cnt_});
				cnt_=1;
			}
			else cnt_++;
		fll=(str[0]=='R');
		flr=(str[str.size()-2]=='L');
		cin>>n;
		for (int i=1; i<=n; i++)
		{
			cin>>str;
			str+='#';
			sv[i].clear();
			cnt_=1;
			for (int j=1; j<str.size(); j++)
				if (str[j-1]!=str[j])
				{
					sv[i].push_back((stru){(str[j-1]=='R'),cnt_});
					cnt_=1;
				}
				else cnt_++;
			flL[i]=(str[0]=='L');
			flR[i]=(str[str.size()-2]=='R');
			pre[i]=i-1;
			nxt[i]=i+1;
			cnt[i]=0;
		}
		sv[0].clear();
		sv[0].push_back((stru){2,0});
		pre[0]=0;
		nxt[0]=1;
		pre[n+1]=n;
		nxt[n+1]=n+1;
		for (int i=0; i<strv.size(); i++)
		{
			cnt_=0;
			for (int j=0; j<=n; j=nxt[j]) c[++cnt_]=j;
			for (int j=1; j<=cnt_; j++)
			{
				if (strv[i].id==sv[c[j]][cnt[c[j]]].id)
				{
					if (strv[i].len>=sv[c[j]][cnt[c[j]]].len)
					{
						if (++cnt[c[j]]==sv[c[j]].size())
						{
							nxt[pre[c[j]]]=nxt[c[j]];
							pre[nxt[c[j]]]=pre[c[j]];
						}
					}
					else sv[c[j]][cnt[c[j]]].len-=strv[i].len;
				}
			}
		}
		for (int i=1; i<=n; i++)
			if (cnt[i]==sv[i].size() && (fll || flL[i]) && (flr || flR[i])) printf("YES\n");
			else printf("NO\n");
	}
	return 0;
}