#line 2 "/home/cocojapanpan/Procon_CPP/proconLibrary/lib/template/procon.hpp"

#ifndef DEBUG
// 提出時にassertはオフ
#ifndef NDEBUG
#define NDEBUG
#endif
// 定数倍高速化
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(x) (x).begin(), (x).end()
template <class T>
using vec = vector<T>;
template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
template <class T>
constexpr T INF = 1'000'000'000;
template <>
constexpr int INF<int> = 1'000'000'000;
template <>
constexpr ll INF<ll> = ll(INF<int>) * INF<int> * 2;
#line 2 "main.cpp"

void solve() {
    int N, M;
    cin >> N >> M;
    vec<int> A(N), B(M);
    for(int &a : A) cin >> a;
    for(int &b : B) cin >> b;
    sort(ALL(A)); sort(ALL(B));
    int A_id = 0, B_id = 0;
    if(M == 0) {
        cout << "Yes\n";
        for(int a : A) {
            cout << "Red " << a << "\n";
        }
        return;
    }
    if(N == 0) {
        cout << "Yes\n";
        for(int b : B) {
            cout << "Blue " << b << "\n";
        }
        return;
    }
    bool red = true;
    vec<pair<bool, int>> ans;
    if(B[0] < A[0]) {
        ans.push_back({false, B[0]});
        red = false;
        B_id = 1;
    } else {
        ans.push_back({true, A[0]});
        A_id = 1;
    }
    while(A_id < N || B_id < M) {
        if(red) {
            if(B[B_id] == A[A_id - 1]) {
                ans.push_back({false, B[B_id]});
                red = false;
                ++B_id;
            } else {
                if(A_id == N) break;
                ans.push_back({true, A[A_id]});
                ++A_id;
            }
        } else {
            if(A[A_id] == B[B_id - 1]) {
                red = true;
                ans.push_back({true, A[A_id]});
                ++A_id;
            } else {
                if(B_id == M) break;
                ans.push_back({false, B[B_id]});
                ++B_id;
            }
        }
    }
    if(A_id < N || B_id < M) {
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
    for(pair<bool, int> p : ans) {
        if(p.first) cout << "Red ";
        else cout << "Blue ";
        cout << p.second << "\n";
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    for(int i = 0; i < T; i++) {
        solve();
    }
}