#include // clang-format off using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair; const ll INF=4e18; void print0(){}; template void print0(H h,T... t){cout<void print(H h,T... t){print0(h);if(sizeof...(T)>0)print0(" ");print(t...);} void perr0(){}; template void perr0(H h,T... t){cerr<void perr(H h,T... t){perr0(h);if(sizeof...(T)>0)perr0(" ");perr(t...);} void ioinit() { cout<> N >> M; unordered_set A; unordered_set B; for (ll i = 0; i < N; i++) { ll x; cin >> x; A.insert(x); } for (ll i = 0; i < M; i++) { ll x; cin >> x; B.insert(x); } unordered_set p; unordered_set aa; unordered_set bb; for (auto x : A) { if (B.count(x)) { p.insert(x); } else { aa.insert(x); } } for (auto x : B) { if (A.count(x)) { ; } else { bb.insert(x); } } if (p.size() == 0) { if (aa.size() == 0) { print("Yes"); for (auto x : bb) { print("Blue", x); } } else if (bb.size() == 0) { print("Yes"); for (auto x : aa) { print("Red", x); } } else { print("No"); } } else { print("Yes"); for (auto x : aa) { print("Red", x); } ll xp = -1; for (auto x : p) { xp = x; print("Red", x); print("Blue", x); break; } for (auto x : bb) { print("Blue", x); } bool blue = true; for (auto x : p) { if (x == xp) continue; if (blue) { print("Blue", x); print("Red", x); } else { print("Red", x); print("Blue", x); } blue = !blue; } } } int main() { ioinit(); ll T; cin >> T; while (T--) { solve(); } return 0; }