#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

void solve() {
  int n, m; cin >> n >> m;
  vector<int> a(n), b(m);
  REP(i, n) cin >> a[i];
  ranges::sort(a);
  REP(i, m) cin >> b[i];
  ranges::sort(b);
  if (n == 0) {
    cout << "Yes\n";
    for (const int blue : b) cout << "Blue " << blue << '\n';
    return;
  }
  if (m == 0) {
    cout << "Yes\n";
    for (const int red : a) cout << "Red " << red << '\n';
    return;
  }
  vector<int> common;
  ranges::set_intersection(a, b, back_inserter(common));
  if (common.empty()) {
    cout << "No\n";
    return;
  }
  vector<int> c, d;
  ranges::set_difference(a, common, back_inserter(c));
  ranges::set_difference(b, common, back_inserter(d));
  cout << "Yes\n";
  for (const int red : c) cout << "Red " << red << '\n';
  cout << "Red " << common.back() << '\n'
       << "Blue " << common.back() << '\n';
  common.pop_back();
  for (const int blue : d) cout << "Blue " << blue << '\n';
  for (bool is_red = false; !common.empty(); common.pop_back(), is_red = !is_red) {
    if (is_red) {
      cout << "Red " << common.back() << '\n'
           << "Blue " << common.back() << '\n';
    } else {
      cout << "Blue " << common.back() << '\n'
           << "Red " << common.back() << '\n';
    }
  }
}

int main() {
  int t; cin >> t;
  while (t--) solve();
  return 0;
}