/* 
*   @author:- SYEDA SADIATUL JANNAT TUSHI
*   date & time :2025-01-02 20:29:39
*   BANGLADESH , SYLHET. 
*/

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

#define endl          '\n'
#define ll            long long
#define vi            vector<ll>
#define pii           pair<ll,ll>
#define vii           vector<pii>
#define sz(x)         (int)x.size()
#define be(x)         x.begin(), x.end()
#define srt(v)         sort(v.begin(),v.end())
#define rsrt(v)        sort(v.rbegin(),v.rend())
#define fl(i, a, b)   for(ll i = (a); i < (b); i++)
#define print(v)      for(auto e:v) cout<<e<<" "; cout<<endl;
#define InShaAllah    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

void solve() {
    ll n,m;
    cin>> n >>m;

    vi a(n),b(m);

    set<ll>aa;
    set<ll>bb;

    fl(i,0,n){
        cin>> a[i];
        aa.insert(a[i]);
    }
    fl(i,0,m){
        cin>> b[i];
        bb.insert(b[i]);
    }

    bool ok=true;
    bool okk=true;

    fl(i,1,31){
        if(aa.count(i / 10) == 0){
            ok=false;
        }
        if(bb.count(i%10) == 0){
            okk=false;
        }
    }

    if(ok && okk){
        cout << "YES" <<endl;
        cout<< endl;
    }
    else{
        cout<< "NO" <<endl;
        cout<<endl;
    }
}

int main() {
    InShaAllah
    ll t = 1;
    cin >> t;

    while (t--) {
        solve();
    }
    return 0;
}