#include<bits/stdc++.h>
using namespace std;
#define pi pair<int,int>
#define vec vector<int>
#define int long long 
#define pb push_back
#define M 998244353
void in(int &x){
    int f=1;x=0;
    char c=getchar();
    while(!isdigit(c)&&c!='-')c=getchar();
    if(c=='-')f=-1,c=getchar();
    while(isdigit(c))x=x*10+c-'0',c=getchar();
    x*=f;
}
int t,n,m,k,x,y,a[1000005],b[1000005];
struct node{int x,tp;}d[1000005];
bool cmp(node q,node w){return q.x<w.x;}
void solve(){
    in(n);in(m);
    for(int i=1;i<=n;i++)in(a[i]);
    for(int i=1;i<=m;i++)in(b[i]);
    sort(a+1,a+1+n);sort(b+1,b+1+m);
    int s=0;
    if(a[1]==1){s=1;for(int i=1;i<=n;i++)if(a[i]!=1)s++,a[i]--;a[1]--;}
    else{s=max(0ll,n-b[1]);b[1]=0;for(int i=1;i<=n;i++)a[i]--;}
    sort(a+1,a+1+n);sort(b+1,b+1+m);int cur=0;
    for(int i=1,j=1,k=0;i<=n||j<=m;k++){
        if(j==m+1){puts("YES");return;}
        if(i<=n&&a[i]<=k){i++;continue;}
        if(j<=m&&b[j]<=k){j++;continue;}
        if(j<=m&&cur+b[j]-k<=s){cur+=b[j]-k;j++;continue;}
        puts("NO");return;
    }
    puts("YES");
}
signed main(){
    in(t);
    while(t--)solve();
}