#include<bits/stdc++.h>
using namespace std;
typedef  long long LL;
typedef pair<LL,LL> PII;
const int N=2e5+10,M=2e6;
const int mod=998244353;
const LL P=1e9+7;
const LL INF=1e18;
LL h[N],e[M],ne[M],w[M],idx;

int n;


void solve(){
   int n,m;
   cin>>n>>m;

   int cnt=0,nw=0;

   vector<int> a,b;

   bool fg=false;
   for(int i=0;i<n;i++){
        int  x;
        cin>>x;

         if(x==1&&!fg){
            fg=true,cnt++,nw++;
            continue;
        }
        else if(x==1){
            nw++;
            continue;
        }

        cnt++;
        a.push_back(x-1);
   }

   for(int i=0;i<m;i++){
        int x;
        cin>>x;

        b.push_back(x);
   }

   sort(a.begin(),a.end());
   sort(b.begin(),b.end());
   //cout<<nw<<" "<<cnt<<endl;
   bool sg=true;
   multiset<int> st;
   int i=0,j=0;

   while(j<m){
        //cout<<1<<endl;
        //cout<<b[j]<<endl;
        //cout<<cnt<<" "<<nw<<endl;
        //cout<<b[j]-nw<<endl;
        if(nw>=b[j]) j++,nw++;
        else if(b[j]-nw<=cnt) {
            cnt-=b[j]-nw;
            nw++,j++;
        }
        else sg=false,j++;
        //cout<<b[j]<<endl;
        //cout<<cnt<<" "<<nw<<endl;

        while(i<a.size()&&nw>=a[i]&&a[i]<b[j]) i++,nw++;

   }

   if(sg) cout<<"Yes"<<endl;
   else cout<<"No"<<endl;
}
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T=1;
    cin>>T;

    while(T--) solve();
 
    return 0;
}