#include <bits/stdc++.h>
using namespace std;

void solve([[maybe_unused]] int t)
{
  int n, m;
  cin >> n >> m;

  vector<long long> a(n), b(m);
  for (auto &i : a)
    cin >> i;
  for (auto &i : b)
    cin >> i;

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

  long long val = -1;
  for (int i = 0; i < n; i++)
    val -= a[i] - 1;
  for (int i = 0; i < m; i++)
    val += max(0ll, b[i] - n - i);

  cout << (val > 0 ? "No" : "Yes") << "\n";
}

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

  int n = 1;
  cin >> n;
  for (int i = 1; i <= n; i++)
    solve(i);
}