#include <bits/stdc++.h>
using namespace std;
#define my_ind 2
#define other_ind 1
void sol()
{
    int n, m;
    cin >> n >> m;
    // val, type
    // vector<pair<int, int>> vec;
    vector<int> my_hp_vec;
    int can_do = 0;
    int one_cnt = 0;
    for (int i = 0; i < n; i++)
    {
        int num;
        cin >> num;
        if(num > 1)
        {
            my_hp_vec.push_back(num - 1);
            can_do++;
        }
        else
        {
            my_hp_vec.push_back(num);
            one_cnt++;
        }
            
    }
    vector<int> void_vec;
    int pmy = 0;
    for(int i = 0; i < n + m; i++)
    {
        int ex_num = max(i, 1);
        if(pmy < n && my_hp_vec[pmy] <= ex_num)
        {
            pmy++;
        }
        else
        {
            void_vec.push_back(max(i, 1));
        }
    }
    vector<int> other_ex;
    for (int i = 0; i < m; i++)
    {
        int num;
        cin >> num;
        other_ex.push_back(num);
    }
    sort(other_ex.begin(), other_ex.end());
    int op = 0;
    for (int i = 0; i < m; i++)
    {
        if(other_ex[i] > void_vec[i])
        {
            op += other_ex[i] - void_vec[i];
        }
    }
    
    if(one_cnt == 0)
    {
        if(can_do >= op)
        {
            int yu = (can_do - op);
            if(yu >= void_vec[0])
            {
                cout << "Yes\n";
            }
            else
            {
                cout << "No\n";
            }

        }
        else
            cout << "No\n";
    }
    else
    {
        
        if(can_do + 1 >= op)
            cout << "Yes\n";
        else
            cout << "No\n";
    }
    
}
int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        sol();
    }
}