#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define double long double
int t, n, m;

const int N = 5e5 + 10;

int my[N], you[N];

void solve() {
	cin >> n >> m;
	for (int i = 1; i <= n; ++i)cin >> my[i];
	for (int i = 1; i <= m; ++i)cin >> you[i];
	
	sort(my + 1, my + 1 + n);
	sort(you + 1, you + 1 + m);
	
	int idx_my = 1, idx_you = 1, deadline = 1;
	int hurt = 0, judge = 0;
	
	for (int i = 1; i <= n; ++i) {
		if (my[i] == 1) {
			if (judge)continue;
			judge = 1;
			++idx_my;
		}
		--my[i], ++hurt;
	}
	
	if (judge == 0) {
		if (hurt >= you[idx_you]) {
			hurt -= you[idx_you];
			++idx_you;
		}
		else {
			cout << "NO" << endl;
			return;
		}
	}
	
	while (idx_you<=m) {
		while (idx_my <= n && my[idx_my] <= deadline) {
			++idx_my, ++deadline;
		}
		
		if(you[idx_you]<=deadline){
			++deadline;
			++idx_you;
		}
		else if (you[idx_you] <= deadline + hurt) {
			++idx_you;
			hurt -= hurt + deadline - you[idx_you];
		}
		else{
			break;
		}
		
		if (idx_you == m + 1)break;
	}
	
	if (idx_you == m + 1)cout << "YES" << endl;
	else cout << "NO" << endl;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	//srand(time(0));
	t = 1;
	cin >> t;
	while (t--)solve();
	return 0;
}