#ifndef HIDDEN_IN_VS // 折りたたみ用

// 警告の抑制
#define _CRT_SECURE_NO_WARNINGS

// ライブラリの読み込み
#include <bits/stdc++.h>
using namespace std;

// 型名の短縮
using ll = long long; // -2^63 ～ 2^63 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）
using pii = pair<int, int>;	using pll = pair<ll, ll>;	using pil = pair<int, ll>;	using pli = pair<ll, int>;
using vi = vector<int>;		using vvi = vector<vi>;		using vvvi = vector<vvi>;
using vl = vector<ll>;		using vvl = vector<vl>;		using vvvl = vector<vvl>;
using vb = vector<bool>;	using vvb = vector<vb>;		using vvvb = vector<vvb>;
using vc = vector<char>;	using vvc = vector<vc>;		using vvvc = vector<vvc>;
using vd = vector<double>;	using vvd = vector<vd>;		using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;

// 定数の定義
const double PI = acos(-1);
const vi DX = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）
const vi DY = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004004004004004LL;
double EPS = 1e-15;

// 入出力高速化
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;

// 汎用マクロの定義
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define YES(b) {cout << ((b) ? "YES\n" : "NO\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順
#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）
#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）
#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d ビット全探索（昇順）
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去
#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了

// 汎用関数の定義
template <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）
template <class T> inline T get(T set, int i) { return (set >> i) & T(1); }

// 演算子オーバーロード
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }

#endif // 折りたたみ用


#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;

#ifdef _MSC_VER
#include "localACL.hpp"
#endif

//using mint = modint1000000007;
using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);

namespace atcoder {
	inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
	inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;
#endif


#ifdef _MSC_VER // 手元環境（Visual Studio）
#include "local.hpp"
#else // 提出用（gcc）
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define gcd __gcd
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }
#endif


// A[1..N], B[1..N] が全て互いに異なるという条件を見落としていた．
void WA() {
	int t;
	cin >> t;

	rep(hoge, t) {
		int n, m;
		cin >> n >> m;

		unordered_map<int, pii> cnt;
		rep(i, n) {
			int a;
			cin >> a;

			cnt[a].first++;
		}
		rep(j, m) {
			int b;
			cin >> b;

			cnt[b].second++;
		}

		if (n == 0) {
			Yes(1);
			for (auto [num, crb] : cnt) {
				auto [cr, cb] = crb;

				rep(hoge, cb) cout << "Blue " << num << endl;
			}
			continue;
		}
		else if (m == 0) {
			Yes(1);
			for (auto [num, crb] : cnt) {
				auto [cr, cb] = crb;

				rep(hoge, cr) cout << "Red " << num << endl;
			}
			continue;
		}

		vector<pii> r_to_r, r_to_b, b_to_b;
		vi rmd_r, rmd_b;

		for (auto [num, crb] : cnt) {
			auto [cr, cb] = crb;

			if (cr > cb && cb > 0) {
				r_to_r.push_back({ num, cb });
				rep(hoge, cb + 1 - cr) rmd_r.push_back(num);
			}
			else if (cr < cb && cr > 0) {
				b_to_b.push_back({ num, cr });
				rep(hoge, cr + 1 - cb) rmd_b.push_back(num);
			}
			else if (cr == cb && cr > 0) {
				r_to_b.push_back({ num, cr });
			}
			else if (cr > 0) {
				rep(hoge, cr) rmd_r.push_back(num);
			}
			else if (cb > 0) {
				rep(hoge, cb) rmd_r.push_back(num);
			}
		}

		if (sz(r_to_r) == 0 && sz(r_to_b) == 0 && sz(b_to_b) == 0) {
			Yes(0);
			continue;
		}

		if (sz(r_to_b) % 2 == 0) {
			if (sz(r_to_r) > 0) {
				rmd_r.push_back(r_to_r.back().first);
				r_to_b.push_back(r_to_r.back());
				r_to_r.pop_back();
			}
			else if (sz(b_to_b) > 0) {
				rmd_b.push_back(b_to_b.back().first);
				r_to_b.push_back(b_to_b.back());
				b_to_b.pop_back();
			}
		}

		repe(x, rmd_r) cout << "Red " << x << endl;

		for (auto [num, c] : r_to_r) {
			cout << "Red " << num << endl;
			rep(hoge, c) {
				cout << "Blue " << num << endl;
				cout << "Red " << num << endl;
			}
		}

		int t = 0;
		for (auto [num, c] : r_to_b) {
			if (t % 2 == 0) {
				rep(hoge, c) {
					cout << "Red " << num << endl;
					cout << "Blue " << num << endl;
				}
			}
			else {
				rep(hoge, c) {
					cout << "Blue " << num << endl;
					cout << "Red " << num << endl;
				}
			}
			t++;
		}

		//
	}
}


int main() {
	input_from_file("input.txt");
//	output_to_file("output.txt");

	int t;
	cin >> t;

	rep(hoge, t) {
		int n, m;
		cin >> n >> m;

		unordered_map<int, pii> cnt;
		rep(i, n) {
			int a;
			cin >> a;

			cnt[a].first++;
		}
		rep(j, m) {
			int b;
			cin >> b;

			cnt[b].second++;
		}

		if (n == 0) {
			Yes(1);
			for (auto [num, crb] : cnt) {
				auto [cr, cb] = crb;

				rep(hoge, cb) cout << "Blue " << num << endl;
			}
			continue;
		}
		else if (m == 0) {
			Yes(1);
			for (auto [num, crb] : cnt) {
				auto [cr, cb] = crb;

				rep(hoge, cr) cout << "Red " << num << endl;
			}
			continue;
		}

		vi r, b, rb;

		for(auto [num, crb] : cnt) {
			auto [cr, cb] = crb;

			if (cr == 1 && cb == 1) rb.push_back(num);
			else if (cr == 1) r.push_back(num);
			else if (cb == 1) b.push_back(num);
		}

		if (rb.empty()) {
			Yes(0);
			continue;
		}
		Yes(1);

		if (sz(rb) % 2 == 1) {
			repe(x, r) cout << "Red " << x << endl;
			rep(i, sz(rb)) {
				cout << (i % 2 == 0 ? "Red " : "Blue ") << rb[i] << endl;
				cout << (i % 2 == 1 ? "Red " : "Blue ") << rb[i] << endl;
			}
			repe(x, b) cout << "Blue " << x << endl;
		}
		else {
			if (r.empty()) {
				repe(x, b) cout << "Blue " << x << endl;
				rep(i, sz(rb)) {
					cout << (i % 2 == 1 ? "Red " : "Blue ") << rb[i] << endl;
					cout << (i % 2 == 0 ? "Red " : "Blue ") << rb[i] << endl;
				}
			}
			else if (b.empty()) {
				repe(x, r) cout << "Red " << x << endl;
				rep(i, sz(rb)) {
					cout << (i % 2 == 0 ? "Red " : "Blue ") << rb[i] << endl;
					cout << (i % 2 == 1 ? "Red " : "Blue ") << rb[i] << endl;
				}
			}
			else {
				r.push_back(rb.back());
				b.push_back(rb.back());
				rb.pop_back();

				repe(x, r) cout << "Red " << x << endl;
				rep(i, sz(rb)) {
					cout << (i % 2 == 0 ? "Red " : "Blue ") << rb[i] << endl;
					cout << (i % 2 == 1 ? "Red " : "Blue ") << rb[i] << endl;
				}
				repe(x, b) cout << "Blue " << x << endl;
			}
		}
	}
}