#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n, m; cin >> n >> m;
		vector<int>a(n), b(m);
		rep(i, n)cin >> a[i];
		rep(i, m)cin >> b[i];
		vector<int>na, nb, x;
		{
			multiset<int>mst;
			rep(i, a.size())mst.insert(a[i]);
			rep(i, b.size()) {
				if (mst.end() == mst.find(b[i])) {
					nb.push_back(b[i]);
					continue;
				}
				x.push_back(b[i]);
				mst.erase(mst.find(b[i]));
			}
			for (auto e : mst)na.push_back(e);
		}
		if (!x.size() && (n && m)) {
			cout << "No" << endl;
			continue;
		}
		cout << "Yes" << endl;
		vector<pair<string, int>>ans;
		rep(i, na.size()) ans.push_back({ "Red",na[i] });
		if (x.size()) {
			ans.push_back({ "Red",x[0] });
			ans.push_back({ "Blue",x[0] });
		}
		rep(i, nb.size()) ans.push_back({ "Blue",nb[i] });
		rep2(i, 1, x.size()) {
			if (0 == i % 2) {
				ans.push_back({ "Red",x[i] });
				ans.push_back({ "Blue",x[i] });
			}
			else {
				ans.push_back({ "Blue",x[i] });
				ans.push_back({ "Red",x[i] });
			}
		}
		rep(i, ans.size()) {
			cout << ans[i].first << " " << ans[i].second << endl;
		}
	}
	return 0;
}