#include <bits/stdc++.h>
using namespace std;

#define ll long long

int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int dx2[] = {1, -1, 0, 0, -1, 1, -1, 1};
int dy2[] = {0, 0, 1, -1, 1, 1, -1, -1};
int knightX[] = {-2, -2, 2, 2, 1, 1, -1, -1};
int knightY[] = {-1, 1, -1, 1, -2, 2, -2, 2};

const ll INF = 0x3f3f3f3f;
const int N = 1e6 + 5, K = 105;
const ll MOD = 1e9 + 7;

int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        int n , m;
        cin >> n >> m;
        vector<bool> v(10 , false) , vv(10 , false);
        for(int i = 0; i < n; i++){
            int x;
            cin >> x;
            v[x] = true;
        }
        for(int i = 0; i < m; i++){
            int x;
            cin >> x;
            vv[x] = true;
        }

        cout << (v[0] && v[1] && v[2] && v[3] && !count(vv.begin() , vv.end() , false) ? "YES" : "NO") << endl;
    }

    return 0;
}