#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

using ll = unsigned long long;

int main() {
    char const* yes = "Yes", * no = "No";
    int n, size1, size2, temp, deadline, hurt;
    vector<int> vec1, vec2;
    cin >> n;
    while (n--) {
        cin >> size1 >> size2;
        for (int i = 0; i < size1; ++i) {
            cin >> temp;
            vec1.push_back(temp);
        }
        for (int i = 0; i < size2; ++i) {
            cin >> temp;
            vec2.push_back(temp);
        }

        sort(vec1.begin(), vec1.end());
        sort(vec2.begin(), vec2.end());

        hurt = size1 + 1;
        deadline = 0;
        int idx1 = 0, idx2 = 0;
        while (idx1 < size1 && vec1[idx1] == 1) {
            --hurt, ++deadline, ++idx1;
        }
        while (idx1 < size1 && vec1[idx1] <= deadline) {
            ++idx1, ++deadline;
        }
        while (idx2 < size2 && vec2[idx2] <= deadline) {
            ++idx2, ++deadline;
        }
        if (idx2 == size2) {
            cout << yes << endl;
            continue;;
        }
        if (idx1) {
            --vec2[idx2];            
        }

        int curIdx1 = idx1;
        while (hurt) {
            while (idx1 < size1 && vec1[idx1] <= deadline) {
                ++idx1, ++curIdx1, ++deadline;
            }
            while (idx2 < size2 && vec2[idx2] <= deadline) {
                ++idx2, ++deadline;
            }
            if (idx2 < size2 && idx1 < size1 && curIdx1 < size1) {
                --vec1[curIdx1], --vec2[idx2], ++curIdx1;
            }
            --hurt;
        }
        while (idx1 < size1 && vec1[idx1] <= deadline) {
            ++idx1, ++curIdx1, ++deadline;
        }
        while (idx2 < size2 && vec2[idx2] <= deadline) {
            ++idx2, ++deadline;
        }
        if (idx2 == size2) {
            cout << yes << endl;
        } else {
            cout << no << endl;
        }
        vec1.clear(), vec2.clear();
    }
    return 0;
}