import copy
import sys
from collections import deque, Counter
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353

def solve():
    n, m = mi()
    a = set(mi())
    b = set(mi())
    pair = []
    for v in list(a):
        if v in b:
            pair.append(v)
            a.discard(v)
            b.discard(v)
    ans1 = []
    cnt = 0
    for v in pair:
        if cnt % 2 == 0:
            ans1.append(('Red', v))
            ans1.append(('Blue', v))
        else:
            ans1.append(('Blue', v))
            ans1.append(('Red', v))
        cnt += 1

    ax = copy.copy(a)
    bx = copy.copy(b)
    ans3 = ans1[::]
    cnt = 0
    while a or b:
        if b:
            ans1.append(('Blue', b.pop()))
        elif a:
            ans1.append(('Red', a.pop()))
        cnt += 1
    cnt = 0
    a = copy.copy(ax)
    b = copy.copy(bx)
    while a or b:
        if a:
            ans3.append(('Red', a.pop()))
        elif b:
            ans3.append(('Blue', b.pop()))
        cnt += 1

    ans2 = []
    cnt = 0
    for v in pair:
        if cnt % 2 == 1:
            ans2.append(('Red', v))
            ans2.append(('Blue', v))
        else:
            ans2.append(('Blue', v))
            ans2.append(('Red', v))
        cnt += 1
    a = copy.copy(ax)
    b = copy.copy(bx)
    ans4 = ans2[::]
    cnt = 0
    while a or b:
        if a:
            ans2.append(('Red', a.pop()))
        elif b:
            ans2.append(('Blue', b.pop()))
        cnt += 1
    a = copy.copy(ax)
    b = copy.copy(bx)
    cnt = 0
    while a or b:
        if b:
            ans4.append(('Blue', b.pop()))
        elif a:
            ans4.append(('Red', a.pop()))
        cnt += 1

    cnt1 = 0

    for i in range(len(ans1) - 1):
        if ans1[i][0] != ans1[i + 1][0]:
            cnt1 += 1
        if ans1[i][0] != ans1[i + 1][0] and ans1[i][1] != ans1[i + 1][1]:
            cnt1 -= inf
    cnt2 = 0
    for i in range(len(ans2) - 1):
        if ans2[i][0] != ans2[i + 1][0]:
            cnt2 += 1
        if ans2[i][0] != ans2[i + 1][0] and ans2[i][1] != ans2[i + 1][1]:
            cnt2 -= inf
    cnt3 = 0
    
    for i in range(len(ans2) - 1):
        if ans3[i][0] != ans3[i + 1][0]:
            cnt3 += 1
        if ans3[i][0] != ans3[i + 1][0] and ans3[i][1] != ans3[i + 1][1]:
            cnt3 -= inf

    cnt4 = 0
    
    for i in range(len(ans2) - 1):
        if ans4[i][0] != ans4[i + 1][0]:
            cnt4 += 1
        if ans3[i][0] != ans4[i + 1][0] and ans4[i][1] != ans4[i + 1][1]:
            cnt4 -= inf
    if max(cnt1, cnt2, cnt3, cnt4) < 0:
        print('No')
        return
    print('Yes')

    if max(cnt1, cnt2, cnt3, cnt4) == cnt1:
        for x, y in ans1:
            print(x, y)
    elif max(cnt1, cnt2, cnt3, cnt4) == cnt2:
        for x, y in ans2:
            print(x, y)
    elif max(cnt1, cnt2, cnt3, cnt4) == cnt3:
        for x, y in ans3:
            print(x, y)
    elif max(cnt1, cnt2, cnt3, cnt4) == cnt4:
        for x, y in ans4:
            print(x, y)
    

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