#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) x1*y2-x2*y1 #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2 #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } using val = ll; using func = ll; val op(val a, val b) { return max(a, b); } val e() { return 0; } val mp(func f, val a) { if (f == -1) return a; return f; } func comp(func f, func g) { if (f == -1) return g; return f; } func id() { return -1; } ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; int main() { ll t; cin >> t; while (t--) { ll n, m; cin >> n >> m; unordered_set sa, sb, d; auto a = read(n); auto b = read(m); for (auto& v : a) { sa.insert(v); } for (auto& v : b) { if (sa.find(v) != sa.end()) { d.insert(v); sa.erase(v); } else { sb.insert(v); } } bool stB = false; if (d.size() == n && d.size() == m) { stB = false; } else if (d.size() == n) { stB = n % 2 == 0; } else if (d.size() == m) { stB = m % 2 == 1; } VP ans; while (1) { bool find = false; if (stB) { if (!sb.empty()) { auto it = sb.begin(); ans.emplace_back(*it, 1); sb.erase(it); find = true; } else if (!d.empty()) { auto it = d.begin(); ans.emplace_back(*it, 1); ans.emplace_back(*it, 0); d.erase(it); find = true; stB = false; } } else { if (!sa.empty()) { auto it = sa.begin(); ans.emplace_back(*it, 0); sa.erase(it); find = true; } else if (!d.empty()) { auto it = d.begin(); ans.emplace_back(*it, 0); ans.emplace_back(*it, 1); d.erase(it); find = true; stB = true; } } if (!find) break; } if (ans.size() != n + m) { cout << "No\n"; } else { cout << "Yes\n"; for (auto& [v, c] : ans) { if (c) cout << "Blue "; else cout << "Red "; cout << v << "\n"; } } } return 0; }