#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int>PII;
#define endl '\n'
#define x first
#define y second
const int N = 2e5 + 10;
const LL INF = 1e18, mod = 1e9 + 7;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

int n, m;

void Lonelyper(){
    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 boom = 0;
    bool flag = 0;
    int sum = 0;
    int pa = -1;
    for(int i = 1; i <= n; i ++) {
        if(a[i] != 1) {
            pa = i;
            break;
        }
    }
    for(int i = 1; i <= n; i ++){
        if(a[i] == 1 && flag == 0){
            boom ++;
            sum ++;
            flag = 1;
        }
        else if(a[i] == 1) boom ++;
        else if(a[i] != 1) sum ++;
    }
    // cout << boom << ' ' << sum << endl;
    for(int i = 1; i <= m; i ++){
        // cout << boom << ' ' << sum << endl;
        if(sum + boom >= b[i]){
            sum -= max(0, b[i] - boom);
            boom ++;
        }
        else{
            cout << "No" << endl;
            return;
        }
        while(pa <= n && boom >= a[pa] - 1){ 
            pa ++;
            boom ++;
        }
    }
    cout << "Yes" << endl;
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while(t --) {
        Lonelyper();
    }
    return 0;
}