import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
md = 10**9+7
# md = 998244353

def solve():
    def trim(aa):
        naa = []
        for a in aa:
            if a in ss: continue
            naa.append(a)
        return naa

    n, m = LI()
    aa = LI()
    bb = LI()
    ss = set(aa) & set(bb)
    aa = trim(aa)
    bb = trim(bb)

    if aa and bb and not ss:
        print("No")
        return

    print("Yes")
    for a in aa: print("Red", a)
    if ss:
        a = ss.pop()
        print("Red", a)
        print("Blue", a)
    for a in bb: print("Blue", a)
    t, s = "Red", "Blue"
    for a in ss:
        print(s, a)
        print(t, a)
        s, t = t, s

for _ in range(II()): solve()