#include<bits/stdc++.h>
using namespace std;
#define rep2(i,j,k) for(ll i=ll(j);i<ll(k);i++)
#define rep(i,j) rep2(i,0,j)
#define rrep2(i,j,k) for(ll i=ll(j)-1;i>=ll(k);i--)
#define rrep(i,j) rrep2(i,j,0)
#define SZ(a) ll(a.size())
#define eb emplace_back
#define all(a) a.begin(),a.end()
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<ll,ll>;
using vp=vector<P>;
using vvp=vector<vp>;
const ll inf=LLONG_MAX/4;
template<class T>
bool chmin(T& a,T b){return a>b?a=b,1:0;}
template<class T>
bool chmax(T& a,T b){return a<b?a=b,1:0;}

void solve() {
	string s;
	cin >> s;
	int n = SZ(s);
	vl l, r, lr;
	rep(i, n) {
		if(s[i] == 'L') l.eb(i);
		else r.eb(i);
		if(i+1<n and s[i] == 'L' and s[i+1] == 'R') lr.eb(i+1);
	}
	int q;
	cin >> q;
	rep(_, q) {
		string t;
		cin >> t;
		int now = 0;
		int m = SZ(t);
		int i = 0;
		bool ok = true;
		while(i < m) {
			if(i+1 < m and t[i] == 'L' and t[i+1] == 'R') {
				auto it = lower_bound(all(lr), now+1);
				if(it == lr.end()) {
					ok = false;
					break;
				}
				now = *it+1;
				i += 2;
			} else if(t[i] == 'L') {
				auto it = lower_bound(all(l), now);
				if(it == l.end()) {
					ok = false;
					break;
				}
				now = *it+1;
				++i;
			} else {
				auto it = lower_bound(all(r), now);
				if(it == r.end()) {
					ok = false;
					break;
				}
				now = *it+1;
				++i;
			}
		}
		if(t[0] == 'R') ok &= s[0] == 'R';
		if(t[m-1] == 'L') ok &= s[n-1] == 'L';
		cout << (ok ? "YES" : "NO") << '\n';
	}
}

int main(){
	cin.tie(0)->sync_with_stdio(0);
	int t;
	cin >> t;
	rep(_, t) solve();
}