#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (ll i=a;i<b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	int N,M;
	cin>>N>>M;
	set<int> A,B,C;
	rep(i,0,N){
		int a;
		cin>>a;
		A.insert(a);
	}
	rep(i,0,M){
		int a;
		cin>>a;
		B.insert(a);
		if(A.count(a)) C.insert(a),B.erase(a),A.erase(a);
	}
	if(N==0){
		yneos(1);
		for(auto x:B) cout<<"Blue "<<x<<"\n";
		return;
	}
	if(M==0){
		yneos(1);
		for(auto x:A) cout<<"Red "<<x<<"\n";
		return;
	}
	if(C.empty()){
		yneos(0);
		return;
	}
	bool F=1;
	yneos(1);
	string S="Red ";
	string T="Blue ";
	for(auto x:C){
		if(F){
			for(auto y:A){
				cout<<S<<y<<"\n";
			}
		}
		cout<<S<<x<<"\n";
		cout<<T<<x<<"\n";
		if(F){
			for(auto y:B){
				cout<<T<<y<<"\n";
			}
			F=0;
		}
		swap(S,T);
	}
	
}