#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tii;

inline int rd() {
	int sum = 0;
	bool f = 0;
	char ch = getchar();
	for(; !isdigit(ch); ch = getchar()) f |= (ch == '-');
	for(; isdigit(ch); ch = getchar()) sum = sum * 10 + (ch ^ '0');
	return f ? -sum : sum;
}

#define eb emplace_back
#define all(s) (s).begin, (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

constexpr int N = 500007;

char s[N], t[N];
int nr[N], nl[N];

inline void work() {
	scanf("%s", s + 1);
	int n = strlen(s + 1);
	nr[n] = nl[n] = 0;
	per(i, n - 1, 0) {
		nl[i] = nl[i + 1];
		nr[i] = nr[i + 1];
		s[i + 1] == 'R' ? nr[i] = i + 1 : nl[i] = i + 1;
	}
	auto calc = [&](){
		scanf("%s", t + 1);
		int m = strlen(t + 1);
		if (s[1] == 'L' && t[1] == 'R') {puts("NO");return;}
		if (s[n] == 'R' && t[m] == 'L') {puts("NO");return;}
		int nw = 0;
		rep(i, 1, m) {
			nw = (t[i] == 'L' ? nl[nw] : nr[nw]);
			if (!nw) {puts("NO");return;}
		}
		puts("YES");
	};
	per(q, rd(), 1) calc();
}

int main() {
	per(t, rd(), 1) work();
	return 0;
}