#include <bits/stdc++.h>
#define fir first
#define sec second
#define el '\n'
#define debug(x) cout << #x << ":: " << x << endl;
#define int long long
#define FINISH cout << "FINISH" << endl;

#define debugv(x) cout << #x << ":: ";\
    for (auto i : x)                \
        cout << i << " ";           \
    cout << endl

using namespace std;

using ll = long long;
using ld = long double;
using PII = pair<int, int>;
const int inf = 0x3f3f3f3f;
const int N = 200020;
const ld PI = 3.14159265358979323846;


void solve()
{
	int n,m;
	cin>>n>>m;
	vector<int> a(n,0),b(m,0);
	for(int i=0;i<n;i++)cin>>a[i];
	for(int i=0;i<m;i++)cin>>b[i];
	sort(a.begin(),a.end());
	sort(b.begin(),b.end());
	int cnt=n;
	set<int> s;
	for(int i=0;i<n;i++){
		if(a[i]==1)cnt--;
		s.insert(a[i]);
	}
	if(s.count(1))cnt++;
	s.clear();
	int bk=0,q=0;
	for(int i=0;i<n;i++){
		while(a[i]-1<bk)a[i]++;
		s.insert(a[i]-1);
		while(s.count(bk))bk++;
	}
	while(q<m&&cnt>=0){
		while(s.count(bk))bk++;
		while(b[q]>bk&&cnt>0){
			b[q]--;
			cnt--;
		}
		while(b[q]<bk)b[q]++;
		s.insert(bk);
		q++;
	}
	if(b[m-1]<=bk)cout<<"Yes\n";
	else cout<<"No\n";
	return;
}

signed main() 
{
	ios:: sync_with_stdio("false");
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T= 1;
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}