#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint T;
	cin >> T;

	rep(_, T) {
		lint N, M;
		cin >> N >> M;
		vi v(N), w(M), p;
		vin(v);
		vin(w);
		lint a=0, b=0, c=0, x, y, z;
		set<lint> s, t, u;
		rep(i, N) s.insert(v[i]);
		rep(i, M) t.insert(w[i]);
		rep(i, N) {
			if (t.count(v[i])) u.insert(v[i]), p.pb(v[i]);
		}
		if (!u.size() && N && M) cout << "No" << endl;
		else {
			cout << "Yes" << endl;
			rep(i, N) {
				if (!u.count(v[i])) {
					cout << "Red " << v[i] << endl;
				}
			}
			if (p.size()) {
				cout << "Red " << p[0] << endl;
				cout << "Blue " << p[0] << endl;
			}
			rep(i, M) {
				if (!u.count(w[i])) {
					cout << "Blue " << w[i] << endl;
				}
			}
			repx(i, 1, p.size()) {
				if (i%2 == 1) {
					cout << "Blue " << p[i] << endl;
					cout << "Red " << p[i] << endl;
				} else {
					cout << "Red " << p[i] << endl;
					cout << "Blue " << p[i] << endl;
				}
			}
		}
	}
}