#include <bits/stdc++.h> using namespace std; struct iofast_t { iofast_t() { ios::sync_with_stdio(false); cin.tie(nullptr); } } iofast; struct uns_t {} uns; template <typename Element, typename Head, typename ...Args> auto vec(Element init, Head arg, Args ...args) { if constexpr (sizeof...(Args) == 0) return vector(arg, init); else return vector(arg, vec(init, args...)); } template <typename Element, typename Head, typename ...Args> auto vec(uns_t, Head arg, Args ...args) { return vec(Element(), arg, args...); } template <typename Container> auto distance(const Container &c, decltype(begin(c)) iter) { return distance(begin(c), iter); } template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>> auto isort(RIter first, RIter last, Compare comp = Compare()) { vector<int> i(distance(first, last)); iota(begin(i), end(i), 0); sort(begin(i), end(i), [&](auto x, auto y) { return comp(*(first + x), *(first + y)); }); return i; } template <typename, template <typename> typename, typename = void_t<>> struct detect : false_type {}; template <typename T, template <typename> typename Check> struct detect<T, Check, void_t<Check<T>>> : true_type {}; template <typename T, template <typename> typename Check> constexpr inline bool detect_v = detect<T, Check>::value; template <typename T> using has_member_sort = decltype(declval<T>().sort()); template <typename Container, typename Compare = less<typename Container::value_type>> auto sorted(Container c, Compare comp = Compare()) { if constexpr (detect_v<Container, has_member_sort>) { c.sort(comp); return c; } else { sort(begin(c), end(c), comp); return c; } } template <typename Container, typename Compare = equal_to<typename Container::value_type>> auto uniqued(Container c, Compare comp = Compare()) { c.erase(unique(begin(c), end(c), comp), end(c)); return c; } template <typename T, typename Compare = less<T>> T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); } template <typename T, typename Compare = less<T>> T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); } template <typename F> constexpr auto fix(F &&f) noexcept { return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable { return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...); }; } int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; auto a = vec<int>(uns, n); auto b = vec<int>(uns, m); for (auto &e : a) cin >> e; for (auto &e : b) cin >> e; if (n == 0) { cout << "Yes" << '\n'; for (auto v : b) { cout << "Blue " << v << '\n'; } continue; } if (m == 0) { cout << "Yes" << '\n'; for (auto v : a) { cout << "Red " << v << '\n'; } continue; } bool exists = false; map<int, bool> f; for (auto v : a) { f[v] = true; } map<int, bool> g; for (auto v : b) { g[v] = f[v]; exists |= f[v]; } if (!exists) { cout << "No" << '\n'; continue; } cout << "Yes" << '\n'; sort(begin(a), end(a), [&](int x, int y) { return make_tuple(g[x], x) < make_tuple(g[y], y); }); int iter1 = 0; while (iter1 < n && !g[a[iter1]]) { cout << "Red " << a[iter1++] << '\n'; } sort(begin(b), end(b), [&](int x, int y) { if (y == a[iter1]) { return false; } if (x == a[iter1]) { return true; } return make_tuple(g[x], x) < make_tuple(g[y], y); }); cout << "Red " << a[iter1++] << '\n'; int iter2 = 0; cout << "Blue " << b[iter2++] << '\n'; while (iter2 < m && !g[b[iter2]]) { cout << "Blue " << b[iter2++] << '\n'; } bool turn = false; while (iter1 < n || iter2 < m) { if (!turn) { cout << "Blue " << b[iter2++] << '\n'; if (iter1 < n) { cout << "Red " << a[iter1++] << '\n'; } } else { cout << "Red " << a[iter1++] << '\n'; if (iter2 < m) { cout << "Blue " << b[iter2++] << '\n'; } } turn = !turn; } } cout << flush; }