#include<bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define lowbit(x) ((x) & (-x))
using i64 = long long;
using pii = std::pair<int, int>;
void solve()
{
	std::string s;
	std::cin >> s;
	const int n = s.size();
	std::vector<int> a, b;
	for (int i = 0; i < n; ++ i) {
		if (s[i] == 'L') {
			a.push_back(i);
		}
		else {
			b.push_back(i);
		}
	}
	int q;
	std::cin >> q;
	while (q --) {
		std::string t;
		std::cin >> t;
		int i = 0;
		bool ok = true;
		const int m = t.size();
		for (auto c : t) {
			if (c == 'L') {
				auto it = std::lower_bound(all(a), i);
				if (it == a.end()) {
					ok = false;
					break;
				}
				else {
					i = *it + 1;
				}
			}
			else {
				auto it = std::lower_bound(all(b), i);
				if (it == b.end()) {
					ok = false;
				}
				else {
					i = *it + 1;
				}
			}
			std::cerr << i << '\n';
		}
		if (!ok) {
			std::cout << "NO\n";
		}
		else if (t[0] == 'R' && s[0] != 'R') {
			std::cout << "NO\n";
		}
		else if (t.back() == 'L' && s.back() != 'L') {
			std::cout << "NO\n";
		}
		else {
			std::cout << "YES\n";
		}
	}
}
int main()
{
	std::cin.tie(nullptr);
	std::cout.tie(nullptr);
	std::ios::sync_with_stdio(false);
	int T = 1;
	std::cin >> T;
	while (T --) solve();
	return 0;
}