#include<bits/stdc++.h>
using namespace std;bool Mbe;
namespace MAOJUN{

typedef long long ll;
const int N=5e5+5;
int n,m,a[N],b[N*2];

inline void slv(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	for(int i=1;i<=m;i++)scanf("%d",&b[i]);
	sort(a+1,a+n+1);sort(b+1,b+m+1);
	int X=0;
	for(int i=1;i<=n;i++)X+=a[i]>1;
	for(int i=1;i<=n;i++)if(a[i]>1)a[i]--;
	if(a[1]==1)X++;
	else X--;
	for(int i=1,j=1,k=1;j<=m;){
		if(i<=n&&a[i]<=max(1,k-1)){i++;k++;}
		else if(b[j]<=max(1,k-1)){j++;k++;}
		else{X-=b[j]-max(1,k-1);j++;k++;}
	}
	puts(X>=0?"Yes":"No");
}
inline void main(){int T;scanf("%d",&T);while(T--)slv();}

}bool Med;int main(){
#ifdef LOCAL
	freopen("2.in","r",stdin);
	freopen("data.out","w",stdout);
	atexit([]{fprintf(stderr,"%.0lfms\n%lfMB\n",clock()*1000./CLOCKS_PER_SEC,(&Mbe-&Med)/1024./1024);});
#endif
	MAOJUN::main();
	return 0;
}