#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<ll,ll>;
using vp=vector<P>;
using vvp=vector<vp>;
const ll inf=LLONG_MAX/4;
#define rep2(i,j,k) for(ll i=ll(j);i<ll(k);i++)
#define rep(i,k) rep2(i,0,k)
#define rrep2(i,j,k) for(ll i=ll(j)-1;i>=ll(k);i--)
#define rrep(i,k) rrep2(i,k,0)
#define eb emplace_back
#define SZ(a) ll(a.size())
#define all(a) a.begin(),a.end()
template<class T>
bool chmin(T& a, T b){return a>b ? a=b,1:0;}
template<class T>
bool chmax(T& a, T b){return a<b ? a=b,1:0;}

void solve(){
	ll n,m;cin>>n>>m;
	ll exp=0;
	map<ll,ll> a,b;
	vl oa;
	rep(i,n){
		ll x;cin>>x;
		oa.eb(x);
		a[x]++;
	}
	rep(i,m){
		ll x;cin>>x;
		b[x]++;
	}
	auto upd=[&](){
		while(true){
			bool flag = false;
			while(!a.empty()){
				auto na=*a.begin();
				if(na.first>exp) break;
				exp += na.second;
				flag=true;
				a.erase(na.first);
			}
			while(!b.empty()){
				auto nb=*b.begin();
				if(nb.first>exp) break;
				exp += nb.second;
				flag=true;
				b.erase(nb.first);
			}
			if(!flag) break;
		}
	};
	auto print=[&](){
		return;
		cout << exp << endl;
		for(auto el: a){
			rep(i,el.second) cout << el.first << " ";
		}
		cout << endl;
		for(auto el: b){
			rep(i,el.second) cout << el.first << " ";
		}
		cout << endl;
	};
	sort(all(oa));
	for(auto na: oa){
		if(na <= exp || b.empty()) continue;
		ll nb;
		if(na < exp+a[na]) nb=(*b.rbegin()).first;
		else nb = (*b.begin()).first;
		a[na]--;
		b[nb]--;
		if(a[na] == 0) a.erase(na);
		if(b[nb] == 0) b.erase(nb);
		a[na-1]++;
		b[nb-1]++;
		upd();
		print();
	}
	string ans="No";
	if(b.empty()) ans="Yes";
	cout << ans << "\n";
}

int main(){
	cin.tie(0)->sync_with_stdio(0);
	ll t;cin>>t;
	while(t--) solve();
}