#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
typedef pair<int,int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef vector<string> VS;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
vector<int> vx;
inline void divide() {sort(vx.begin(),vx.end());vx.erase(unique(vx.begin(),vx.end()),vx.end());}
inline int mp(int x) {return upper_bound(vx.begin(),vx.end(),x)-vx.begin();}
inline int log_2(int x) {return 31-__builtin_clz(x);}
inline int popcount(int x) {return __builtin_popcount(x);}
inline int lowbit(int x) {return x&-x;}
inline ll Lsqrt(ll x) { ll L = 1,R = 2e9;while(L + 1 < R){ll M = (L+R)/2;if(M*M <= x) L = M;else R = M;}return L;}
bool iszixulie(string &s,string &t) //s为原串,t为子串
{
    int n=s.size(),m=t.size();
    for(int i=0,j=-1;i<m;++i) //i遍历子串,j遍历原串
    {
        ++j;//每次i自增j也要自增防止一直停留在同一处
        while(j+1<n&&s[j]!=t[i]) ++j;
        if(s[j]!=t[i]) return false;
    }
    return true;
}
void solve()
{
    string s;
    cin>>s;
    int n = s.size();
    bool start = (s[0] == 'L'), end = (s[n-1] == 'R');
    int q;
    cin>>q;
    for(int i=0;i<q;++i)
    {
        string t;
        cin>>t;
        int m = t.size();
        if(start) if(t[0] == 'R') {cout<<"NO\n";continue;}
        if(end) if(t[m-1] == 'L') {cout<<"NO\n";continue;}
        if(iszixulie(s,t)) cout<<"YES\n";
        else cout<<"NO\n";
    }
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	cin>>T;
	while(T--)
	{
		solve();
	}
}