#include <bits/stdc++.h>

using namespace std;

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<int> a(n), b(m);
    for(int i = 0; i < n; i ++) cin >> a[i];
    for(int i = 0; i < m; i ++) cin >> b[i];

    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    int cnt = 0;
    for(int i = 0; i < n; i ++)
    {
        if(a[i] <= i) a[i] = i;
        else
        {
            cnt ++;
            a[i] --;
        }
    }

    // cout << "cnt:" << cnt << endl;
    // for(int i = 0; i < n; i ++) cout << a[i] << " \n"[i == n - 1];
    // for(int i = 0; i < m; i ++) cout << b[i] << " \n"[i == m - 1];

    int i = 0, j = 0, now = 0;
    // while(i < n && j < m && cnt >= 0)
    while(1)
    {
        // cout << i << ' ' << a[i] << ' ' << j << ' ' << b[j] << ' ' << now << endl;

        if(j == m)
        {
            cout << "Yes" << endl;
            return;
        }

        if(i < n && a[i] == now) i ++;
        else if(b[j] <= now) j ++;
        else
        {
            // if(now == 4)
            // {
            //     cout << i << ' ' << j << ' ' << cnt << endl;
            // } 

            if(b[j] - now > cnt)
            {
                cout << "No" << endl;
                return;
            }

            cnt -= b[j] - now;
            j ++;
        }

        now ++;
    }

    // cout << "Yes" << endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    cin >> t;
    while(t --)
        solve();

    return 0;
}

/*

3
3 2
1 1 4
2 6
3 2
1 1 4
2 7
2 1
100 100
2


1
3 2
1 1 4
2 7


3
7 1
1 1 1 1 1 1 1
9
5 2
3 4 5 6 7
1 6
5 3
3 4 5 6 7
1 5 7 


*/