#include <limits>
#define LOCAL
#include <bits/stdc++.h>
#define fir first
#define sec second
#define pbk push_back

#ifdef LOCAL
#define FINISH cerr << "FINISH" << endl;
#else
#define FINISH ;
#endif

#ifdef LOCAL
#define debug(x) cerr << setw(4) << #x << " == " << x << endl
#else
#define debug(x)
#endif

#ifdef LOCAL
#define debugv(x)                   \
    cerr << setw(4) << #x << ":: "; \
    for (auto i : x)                \
        cerr << i << " ";           \
    cerr << endl
#else
#define debugv(x)
#endif

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ostream& operator<<(ostream& out, pii& x)
{
    out << x.fir << " " << x.sec << endl;
    return out;
}

const ll MOD = 998244353;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;
const int N = 200020;


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();
	if(a[0]==1)a[0]--;
	for(int i=0;i<n;i++){
		if(a[i]>1)a[i]--;
	}
	int p=0,q=0,ddl=0;
	a.pbk(INF);
	b.pbk(INF);
	while(p<n||q<m){
		if(a[p]<=ddl){
			ddl++;
			p++;
		}
		else{
			if(q==m){
				break;
			}
			int d=b[q]-ddl;
			if(d>cnt){
				cout<<"No\n";
				return;
			}
			else{
				cnt-=d;
				ddl++;
			}
			q++;
		}
	}
	cout<<"Yes\n";
	return;
}
int main()
{
    // ios::sync_with_stdio(false);
    // cin.tie(nullptr);
    // cout.tie(nullptr);
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}