#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long int
#define vv vector<long long>
#define dq deque<long long>
#define mpp map<long long,long long>
#define ms multiset<long long>
#define ss set<long long>
#define vpp vector<pair<long long, long long>>
#define MOD 1000000007
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define all(a) a.begin(),a.end()
#define sort_rev(a) sort(a.rbegin(),a.rend())
#define all_n for(int i=0;i<n;i++)
#define print(a) for(auto it:a)cout<<it<<" "
#define print_pair(a) for(auto it:a)cout<<it.first<<" "<<it.second<<endl
#define scan(a,n) for(int i=0;i<n;i++)cin>>a[i]
void requisite(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
}
void solve(){
    ll n,m;cin>>n>>m;
    ss v,a;
    for (int i = 0; i < n; ++i) {
        int x;cin>>x;
        v.insert(x);
    }
    for (int i = 0; i < m; ++i) {
        int x;cin>>x;
        a.insert(x);
    }
    for (int i = 0; i < 10; ++i) {
        if (v.find(i)==v.end()){
            NO;
            return;
        }
    }
    for (int i = 1; i <=8 ; ++i) {
        if (i==5 or i==7)continue;
        else if (a.find(i)==a.end()){
            NO;
            return;
        }
    }
    YES;
}
int main() {
    requisite();
    ll t=1;
    cin>>t;
    while (t--){
        solve();
    }
    return 0;
}