#include #include using namespace std; using namespace atcoder; #define overload4(_1, _2, _3, _4, name, ...) name #define rep1(n) for(int i = 0; i < (int)(n); ++i) #define rep2(i, n) for(int i = 0; i < (int)(n); ++i) #define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i) #define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i) #define ALL(a) a.begin(), a.end() #define Sort(a) sort(a.begin(), a.end()) #define RSort(a) sort(a.rbegin(), a.rend()) typedef long long int ll; typedef unsigned long long ul; typedef long double ld; typedef vector vi; typedef vector vll; typedef vector vc; typedef vector vst; typedef vector vd; typedef vector vld; typedef pair P; template long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); } template auto min(const T& a){ return *min_element(a.begin(), a.end()); } template auto max(const T& a){ return *max_element(a.begin(), a.end()); } const long long MINF = 0x7fffffffffff; const long long INF = 0x1fffffffffffffff; const long long MOD = 998244353; const long double EPS = 1e-9; const long double PI = acos(-1); template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template istream &operator>>(istream &is, pair &p){ is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const pair &p){ os << "(" << p.first << ", " << p.second << ")"; return os; } template istream &operator>>(istream &is, vector &v){ for(T &in : v) is >> in; return is; } template ostream &operator<<(ostream &os, const vector &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; } template ostream &operator<<(ostream &os, const map &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; } template ostream &operator<<(ostream &os, const set &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template ostream &operator<<(ostream &os, const multiset &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template ostream &operator<<(ostream &os, queue q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; } template ostream &operator<<(ostream &os, deque q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; } template ostream &operator<<(ostream &os, stack st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; } template ostream &operator<<(ostream &os, priority_queue pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; } template inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; } template inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; } template void in(T&... a){ (cin >> ... >> a); } void out(){ cout << '\n'; } template void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } template void inGraph(vector>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } } ll t; void input(){ in(t); } void solve(){ ll n, m; in(n, m); vll a, b; vin(a, n); vin(b, m); if(n == 0){ out("Yes"); rep(i, m){ out("Blue", b[i]); } return; }else if(m == 0){ out("Yes"); rep(i, n){ out("Red", a[i]); } return; } map cnt1, cnt2; rep(i, n) cnt1[a[i]]++; rep(i, m) cnt2[b[i]]++; ll cnt = 0; vector> ans, ansR, ansB; for(auto [k, x] : cnt1){ if(cnt2.count(k) != 0){ cnt++; if(cnt % 2){ ans.emplace_back("Red", k); ans.emplace_back("Blue", k); }else{ ans.emplace_back("Blue", k); ans.emplace_back("Red", k); } }else{ ansR.emplace_back("Red", k); } } for(auto [k, x] : cnt2){ if(cnt1.count(k) != 0){ }else{ ansB.emplace_back("Blue", k); } } if(cnt == 0){ out("No"); }else{ out("Yes"); for(auto [x, y] : ansR){ out(x, y); } ll siz = ans.size(); out(ans[0].first, ans[0].second); out(ans[1].first, ans[1].second); for(auto [x, y] : ansB){ out(x, y); } rep(i, 2, siz){ out(ans[i].first, ans[i].second); } } } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20); input(); while(t--) solve(); }