#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

void solve(){
    int N,M;
    cin>>N>>M;
    vector<int>a(N),b(M);
    map<int,int>mpa,mpb;
    rep(i,N){
        cin>>a[i];
        mpa[a[i]]++;
    }
    rep(i,M){
        cin>>b[i];
        mpb[b[i]]++;
    }
    vector<int>v;
    for(auto[x,la]:mpa){
        int lb=mpb[x];
        rep(i,min(la,lb)){
            v.push_back(x);
            mpa[x]--;
            mpb[x]--;
        }
    }
    if(v.empty()&&N>0&&M>0){
        cout<<"No"<<"\n";
    }else if(N==0||M==0){
        cout<<"Yes"<<"\n";
        if(N==0)rep(i,M)cout<<"Blue"<<" "<<b[i]<<"\n";
        if(M==0)rep(i,N)cout<<"Red"<<" "<<a[i]<<"\n";
    }else{
        cout<<"Yes"<<"\n";
        rep(i,(int)v.size()){
            if(i%2==0){
                if(i==0){
                    for(auto[x,la]:mpa){
                        rep(j,la)cout<<"Red"<<" "<<x<<"\n";
                    }
                }
                cout<<"Red"<<" "<<v[i]<<"\n";
                cout<<"Blue"<<" "<<v[i]<<"\n";
                if(i==0){
                    for(auto[x,lb]:mpb){
                        rep(j,lb)cout<<"Blue"<<" "<<x<<"\n";
                    }
                }
            }else{
                cout<<"Blue"<<" "<<v[i]<<"\n";
                cout<<"Red"<<" "<<v[i]<<"\n";
            }
        }
    }
}

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