#include <bits/stdc++.h>

void solve()
{
	std::string s; std::cin >> s;
	int n = s.size();

	std::vector nxt(100, std::vector<int>(n, -1));
	std::vector<std::vector<int>> pos(100);
	std::vector<int> lst(100, -1);
	for(int i = 0; i < n; i++)
	{
		if(lst[s[i]] != -1) nxt[s[i]][lst[s[i]]] = i;
		lst[s[i]] = i;
		pos[s[i]].emplace_back(i);
	}
	nxt['L'][pos['L'].back()] = n;
	nxt['R'][pos['R'].back()] = n;
	for(int i = 1; i < n; i++)
	{
		nxt['L'][i] = std::max(nxt['L'][i], nxt['L'][i - 1]);
		nxt['R'][i] = std::max(nxt['R'][i], nxt['R'][i - 1]);
	}

	int q; std::cin >> q;
	while(q--)
	{
		std::string t; std::cin >> t;
		int m = t.size();

		if(m == 1)
		{
			if(t == "R" && s.front() == 'R') std::cout << "YES\n";
			else if(t == "L" && s.back() == 'L')  std::cout << "YES\n";
			else std::cout << "NO\n";
			continue;
		}
		if(t.front() == 'R' && s.front() != 'R')
		{
			std::cout << "NO\n";
			continue;
		}

		int cur = pos[t[0]][0];
		bool ok = true;
		for(int i = 1; i < m && cur < n; i++)
		{
			int ncur = nxt[t[i]][cur];
			if(s[i - 1] == 'L' && s[i] == 'R' && ncur - cur > 1) ok = false;
			cur = ncur;
		}
		if(cur >= n) ok = false;

		if(ok) std::cout << "YES\n";
		else std::cout << "NO\n";
	}
}

int main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int t; std::cin >> t;
	while(t--) solve();

	return 0;
}