#include #include #define OVERLOAD_REP(_1, _2, _3, name, ...) name #define REP1(i,n) for (auto i = std::decay_t{}; (i) != (n); ++(i)) #define REP2(i,l,r) for (auto i = (l); (i) != (r); ++(i)) #define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__) #define all(a) (a).begin(),(a).end() #define rall(a) (a).rbegin(),(a).rend() using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using P = pair; using LP = pair; using SP = pair; using vi = vector; using vl = vector; using vs = vector; using vc = vector; using mint1 = modint1000000007; using mint9 = modint998244353; const int INF = 2e9; const long long LINF = 4e18; const int di[] = {0,1,0,-1,-1,1,-1,1}; const int dj[] = {1,0,-1,0,1,1,-1,-1}; template inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;} template inline bool chmax(T& a, T b){if(a> n >> m; vector a(n) , b(m); rep(i , n) cin >> a[i]; rep(i , m) cin >> b[i]; set na , nb , c; for(int i : a) na.insert(i); for(int i : b) nb.insert(i); for(int i : a) if(nb.count(i)) c.insert(i); for(int i : c) na.erase(i); for(int i : c) nb.erase(i); if(m == 0) { cout << "Yes" << endl; for(int i : a) cout << "Red" << ' ' << i << endl; } else if (n == 0) { cout << "Yes" << endl; for(int i : b) cout << "Blue" << ' ' << i << endl; } else { if(c.size() == 0) { cout << "No" << endl; return; } cout << "Yes" << endl; for(int i : na) cout << "Red" << ' ' << i << endl; int nc = *c.begin(); cout << "Red" << ' ' << nc << endl; cout << "Blue" << ' ' << nc << endl; c.erase(nc); for(int i : nb) cout << "Blue" << ' ' << i << endl; int flag = 0; for(int i : c) { if(flag) { cout << "Red" << ' ' << i << endl; cout << "Blue" << ' ' << i << endl; } else { cout << "Blue" << ' ' << i << endl; cout << "Red" << ' ' << i << endl; } flag ^= 1; } } } int main () { int t; cin >> t; rep(i , t) solve(); return 0; }