#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <math.h>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <iomanip>
#include <climits>
#include <functional>
#include <cassert>
#include <tuple>
using namespace std;
using ll = long long;

int T;

int main() {

    cin >> T;
    while(T--) {
        int N, M;
        cin >> N >> M;
        set<int> A,B,P;
        for(int i = 0; i < N; ++i) {
            int a; cin >> a;
            A.insert(a);
        }
        for(int i = 0; i < M; ++i) {
            int b; cin >> b;
            if(A.find(b) != A.end()) {
                A.erase(b);
                P.insert(b);
            }
            else B.insert(b);
        }

        if(N>0 && M>0 && P.empty()) {
            cout << "No" << endl;
            continue;
        } else cout << "Yes" << endl;

        if(!A.empty())for(auto v : A) cout << "Red " << v << endl;
        if(!P.empty()) {
            int x = *P.begin();
            cout << "Red " << x << endl;
            cout << "Blue " << x << endl;
        }
        if(!B.empty())for(auto v : B) cout << "Blue " << v << endl;
        if(P.size()>1) {
            int cnt = 0;
            for(int x : P) {
                if(*P.begin() == x) continue;
                if(cnt%2 == 0) {
                    cout << "Blue " << x << endl;
                    cout << "Red " << x << endl;
                } else {
                    cout << "Red " << x << endl;
                    cout << "Blue " << x << endl;
                }
                cnt++;
            }
        }

    }

}