#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

void solve(){
  int N,M; cin >> N >> M;
  vector<int> A(N), B(M);
  rep(i,N) cin >> A[i];
  rep(i,M) cin >> B[i];
  if(N==0 || M==0){
    cout << "Yes\n";
    rep(i,N) cout << "Red " << A[i] << '\n';
    rep(i,M) cout << "Blue " << B[i] << '\n';
    return;
  }
  sort(all(A));
  sort(all(B));
  vector<ll> RR, BB, RB;
  rep(i,N){
    if(binary_search(all(B),A[i])) RB.pb(A[i]);
    else RR.pb(A[i]);
  }
  rep(i,M){
    if(!binary_search(all(A),B[i])) BB.pb(B[i]);
  }
  if(RB.empty()) cout << "No\n";
  else{
    cout << "Yes\n";
    rep(i,sz(RR)) cout << "Red " << RR[i] << '\n';
    cout << "Red " << RB[0] << '\n';
    cout << "Blue " << RB[0] << '\n';
    rep(i,sz(BB)) cout << "Blue " << BB[i] << '\n';
    for(int i=1;i<sz(RB);i++){
      if(i%2==1){
        cout << "Blue " << RB[i] << '\n';
        cout << "Red " << RB[i] << '\n';
      }
      else{
        cout << "Red " << RB[i] << '\n';
        cout << "Blue " << RB[i] << '\n';
      }
    }
  }
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int T; cin >> T;
  while(T--) solve();
  return 0;
}