#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

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

  int dmg = (one > 0 ? n - one + 1 : n);

  int aoe = (one > 0);
  priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> q;
  bool fst = true;
  for (int i = 1; i <= n; i++) {
    if (a[i] == 1 && fst) {
      fst = false;
    } else {
      q.push({max(a[i] - 1, 1), 0});
    }
  }
  for (int i = 1; i <= m; i++) {
    q.push({b[i], 1});
  }
  while (!q.empty()) {
    auto [x, id] = q.top();
    if (aoe >= x) {
      aoe++;
      q.pop();
    } else {
      break;
    }
  }

  priority_queue<int, vector<int>, greater<>> q1, q2;
  while (!q.empty()) {
    auto [x, id] = q.top();
    q.pop();
    if (id == 0) {
      q1.push(x);
    } else {
      q2.push(x);
    }
  }

  while (!q2.empty() && dmg > 0) {
    int x = q2.top();
    if (x <= aoe) {
      q2.pop();
      aoe++;
    } else if (x - aoe <= dmg) {
      dmg -= (x - aoe);
      aoe++;
      q2.pop();
    } else {
      cout << "No\n";
      return;
    }
    while (!q1.empty()) {
      int y = q1.top();
      if (aoe >= y) {
        aoe++;
        q1.pop();
      } else {
        break;
      }
    }
  }

  cout << "Yes\n";
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);

  int tc;
  cin >> tc;
  while (tc--) {
    solve();
  }

  return 0;
}