#pragma GCC optimize(3)  //O2优化开启
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
const int mod=998244353;
const int MX=0x3f3f3f3f3f3f3f3f; 

int n,m;

int a[500005];

int b[500005];

void icealsoheat(){

    cin>>n>>m;

    for(int i=1;i<=n;i++)cin>>a[i];

    for(int i=1;i<=m;i++)cin>>b[i];

    int cnt=0;

    sort(a+1,a+1+n);

    sort(b+1,b+1+m);

    int id;

    id=1;

    int op=0;

    for(int i=n;i>=1;i--){

        op++;
        if(a[i]==1)break;

    }
    
    queue<int>q;

    while(id<=n&&cnt>=a[id]-1){

        cnt++;
        id++;

    }

    for(int i=1;i<=m;i++){
        assert(op>=0);
        if(op+cnt<b[i]){
            puts("No");
            return;
        }

        op+=q.size();
        
        if(b[i]>cnt-q.size()){
            op-=b[i]-cnt+q.size();
        }

        int g=cnt+1;
        cnt++;
        while(id<=n&&cnt>=a[id]-1){

            cnt++;
            id++;

        }
        if(b[i]>cnt)q.push(b[i]);
        while(q.size()){

            if(q.front()<cnt){
                int need=q.front()-g;
                need=max(0ll,need);
                op+=min(need,cnt-q.front());
                
                q.pop();

            }
            else{
                
                break;

            }

        }

    }

    puts("Yes");

}
signed main(){
    ios::sync_with_stdio(false);          //int128不能用快读！！！！！！
    cin.tie();
    cout.tie();
    int _yq;
    _yq=1;
    cin>>_yq;
    while(_yq--){
        icealsoheat();
    }
}
//
//⠀⠀⠀             ⠀⢸⣿⣿⣿⠀⣼⣿⣿⣦⡀
//⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⠀⠀⠀ ⠀⢸⣿⣿⡟⢰⣿⣿⣿⠟⠁
//⠀⠀⠀⠀⠀⠀⠀⢰⣿⠿⢿⣦⣀⠀⠘⠛⠛⠃⠸⠿⠟⣫⣴⣶⣾⡆
//⠀⠀⠀⠀⠀⠀⠀⠸⣿⡀⠀⠉⢿⣦⡀⠀⠀⠀⠀⠀⠀ ⠛⠿⠿⣿⠃
//⠀⠀⠀⠀⠀⠀⠀⠀⠙⢿⣦⠀⠀⠹⣿⣶⡾⠛⠛⢷⣦⣄⠀
//⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣧⠀⠀⠈⠉⣀⡀⠀ ⠀⠙⢿⡇
//⠀⠀⠀⠀⠀⠀⢀⣠⣴⡿⠟⠋⠀⠀⢠⣾⠟⠃⠀⠀⠀⢸⣿⡆
//⠀⠀⠀⢀⣠⣶⡿⠛⠉⠀⠀⠀⠀⠀⣾⡇⠀⠀⠀⠀⠀⢸⣿⠇
//⢀⣠⣾⠿⠛⠁⠀⠀⠀⠀⠀⠀⠀⢀⣼⣧⣀⠀⠀⠀⢀⣼⠇
//⠈⠋⠁⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⡿⠋⠙⠛⠛⠛⠛⠛⠁
//⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⣾⡿⠋⠀
//⠀⠀⠀⠀⠀⠀⠀⠀⢾⠿⠋⠀
//