#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define int long long

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1), b(m + 1);
    for(int i = 1;i <= n;i++) cin >> a[i];
    for(int i = 1;i <= m;i++) cin >> b[i];
    sort(a.begin() + 1, a.end());
    sort(b.begin() + 1, b.end());
    int a1 = 0, b1 = 0;
    for(int i = 1;i <= n;i++) {
        a1 += (a[i] == 1);
    }
    for(int i = 1;i <= m;i++) {
        b1 += (b[i] == 1);
    }
    int cnt = (a1 != 0);
    for(int i = 1;i <= n;i++) {
        if(a[i] > 1) cnt++, a[i]--;
    }
    int now = a1, flag = 0;
    if(b1) {
        if(!a1) cnt--;
        now += b1;
        flag = 1;
    }
    int k = 1;
    for(int i = 1;i <= m;i++) {
        if(b[i] == 1) {
            continue;
        }
        while(k <= n && a[k] <= now) {
            k++;
            now++;
        }
        int num = b[i] - now;
        if(num <= 0) now++, flag = 1;
        else {
            if(cnt < num) {
                cout << "No" << endl;
                return;
            }
            now++;
            cnt -= num;
            flag = 1;
        }
    }
    cout << "Yes" << endl;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    cin >> T;
    while(T--) {
        solve();
    }

    return 0;
}