#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set1 = tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update>;
#define op()                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define yes cout << "YES\n";
#define no cout << "NO\n";
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a * b) / gcd(a, b))
#define PI 2.0 * acos(0.0)
#define Dpos(n) fixed << setprecision(n)

typedef long long ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const ll MOD = 1e9 + 7;
const ll N = 1e5 + 1;

void solve()
{
    ll n, m, num, i;
    cin >> n >> m;
    vl v1(4), v2(10);
    while (n--)
    {
        cin >> num;
        if (num >= 4)
            continue;
        v1[num]++;
    }
    while (m--)
    {
        cin >> num;
        v2[num]++;
    }
    for (i = 0; i < 4; i++)
    {
        if (!v1[i])
        {
            no return;
        }
    }
    for (i = 1; i < 10; i++)
    {
        if (!v2[i])
        {
            no return;
        }
    }
    yes
}
int main()
{
    op() int tc = 1;
    cin >> tc;

    for (int t = 1; t <= tc; t++)
    {
        // cout << "Case " << t << ": ";
        solve();
    }
}