#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using vi=vector<int>;
using vl=vector<ll>;
using pii=pair<int,int>;
#define all(a) begin(a),end(a)
#define pb push_back

const int N=1e6 + 500,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

int n, m, A[N];

bool cmp(int a, int b) {
	return A[a]  < A[b];
}

void solve() {
	cin >> n >> m;
	vi v, ostalo; 
	int kec = 0;
	for(int i = 0;i < n + m;i++) {
		cin >> A[i];
		if(i < n && A[i] == 1) kec++;
		
		if(i < n) ostalo.pb(A[i]);
		else v.pb(i);
	}
	sort(ostalo.begin(), ostalo.end());
	sort(v.begin(), v.end(), cmp);
	int sad = 0;
	ll vis = 0;
	int j = 0;
	for(int i = 0;i < m;i++) {
		while(j < n && ostalo[j] <= 1 + max(sad, 1)) {
			j++; sad++;
		}
		vis += max(0, A[v[i]] - max(sad++, 1));
	}
	if((!kec && vis < n) || (kec && vis <= n - kec + 1)) cout << "Yes\n";
	else cout << "No\n";
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int T; cin >> T;
	for(;T--;) solve();
}