#pragma GCC optimize(2)
#pragma GCC optimize("Ofast")
#include<map>
#include<set>
#include<cmath>
#include<ctime>
#include<queue>
#include<stack>
#include<cstdio>
#include<vector>
#include<string>
#include<bitset>
#include<numeric>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=5e5+10;
const int N=5e5;
const int INF=0x3f3f3f3f;
const long long LINF=0x3f3f3f3f3f3f3f3f;
int n,m;
int a[MAXN],b[MAXN];
inline void solve(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
	}
	sort(a+1,a+1+n);
	for(int i=1;i<=m;i++)
	{
		scanf("%d",&b[i]);
	}
	sort(b+1,b+1+m);
	int k=0;
	if(a[1]^1){
		k--;
	}
	else{
		k++;
	}
	for(int i=1;i<=n;i++)
	{
		if(a[i]^1){
			k++;
			a[i]--;
		}
	}
	int now=0,p=1;
	#define val (now+!now)
	for(int i=1;i<=m;i++)
	{
		while(p<=n&&a[p]<=val)
		{
			p++;
			now++;
		}
		if(b[i]>val){
			k-=b[i]-val;
		}
		if(k<0){
			puts("No");
			return ;
		}
		now++;
	}
	puts("Yes");
}
signed main(){
	#ifdef LOCAL
	freopen("data.in","r",stdin);
	freopen("data.out","w",stdout);
	atexit([](){fprintf(stderr,"%.3lfs\n",(double)clock()/CLOCKS_PER_SEC);});
	#endif
	int t;
	scanf("%d",&t);
	while(t--)
	{
		solve();
	}
	return 0;
}