#include #include int cmp_int (const void *ap, const void *bp) { int a = *(int *)ap; int b = *(int *)bp; if (a < b) { return -1; } if (a > b) { return 1; } return 0; } int main () { int t = 0; int n = 0; int m = 0; int a[200000] = {}; int b[200000] = {}; int res = 0; int r[200000] = {}; int bl[200000] = {}; int eq[200000] = {}; res = scanf("%d", &t); while (t > 0) { int aidx = 0; int bidx = 0; int rcnt = 0; int bcnt = 0; int eqcnt = 0; res = scanf("%d", &n); res = scanf("%d", &m); for (int i = 0; i < n; i++) { res = scanf("%d", a+i); } for (int i = 0; i < m; i++) { res = scanf("%d", b+i); } qsort(a, n, sizeof(int), cmp_int); qsort(b, m, sizeof(int), cmp_int); while (aidx < n || bidx < m) { if (aidx < n && (bidx >= m || a[aidx] < b[bidx])) { r[rcnt] = a[aidx]; rcnt++; aidx++; } else if (bidx < m && (aidx >= n || a[aidx] > b[bidx])) { bl[bcnt] = b[bidx]; bcnt++; bidx++; } else { eq[eqcnt] = a[aidx]; eqcnt++; aidx++; bidx++; } } if (m <= 0) { printf("Yes\n"); for (int i = 0; i < n; i++) { printf("Red %d\n", a[i]); } } else if (n <= 0) { printf("Yes\n"); for (int i = 0; i < m; i++) { printf("Blue %d\n", b[i]); } } else if (eqcnt <= 0) { printf("No\n"); } else { printf("Yes\n"); for (int i = 0; i < rcnt; i++) { printf("Red %d\n", r[i]); } printf("Red %d\n", eq[0]); printf("Blue %d\n", eq[0]); for (int i = 0; i < bcnt; i++) { printf("Blue %d\n", bl[i]); } for (int i = 1; i < eqcnt; i++) { if (i%2 == 0) { printf("Red %d\n", eq[i]); printf("Blue %d\n", eq[i]); } else { printf("Blue %d\n", eq[i]); printf("Red %d\n", eq[i]); } } } t--; } return 0; }