#include<bits/stdc++.h>

using namespace std;

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n), b(m);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        a[i]--;
    }    
    for (int i = 0; i < m; i++) {
        cin >> b[i];
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    int c1 = count(a.begin(), a.end(), 0);
    if (c1 > 0) c1--;
    int bom = 0, sum = n - c1;

    int i = 0, j = 0;
    while (j < m) {
        int tag = 0;
        while (i < n && bom >= a[i]) {
            i++;
            bom++;
            tag = 1;
        }
        while (j < m && sum + bom >= b[j]) {
            int need = max(0, b[j] - bom);
            assert(sum >= need);
            sum -= need;
            j++;
            bom++;
            tag = 1;
        }
        if (tag == 0) break;
    }
    cout << (j == m ? "Yes\n" : "No\n");
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}