#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      --a[i];
    }
    vector<int> b(m);
    for (int i = 0; i < m; i++) {
      cin >> b[i];
      --b[i];
    }
    vector<bool> del(n);
    for (int i = 0; i < m; i++) {
      del[b[i]] = true;
    }
    multiset<int> st;
    for (int i = 0; i < k; i++) {
      int l;
      cin >> l;
      st.insert(l);
    }
    vector<int> L(n);
    vector<int> R(n);
    {
      vector<int> stk;
      for (int i = 0; i < n; i++) {
        int low = 0, high = int(stk.size()) - 1, id = -1;
        while (low <= high) {
          int mid = low + high >> 1;
          if (a[stk[mid]] > a[i]) {
            id = stk[mid];
            low = mid + 1;
          } else {
            high = mid - 1;
          }
        }
        L[i] = id;
        if (del[a[i]]) {
          while (!stk.empty() && a[stk.back()] < a[i]) {
            stk.pop_back();
          }
          stk.push_back(i);
        }
      }
    }
    {
      vector<int> stk;
      for (int i = n - 1; i >= 0; i--) {
        int low = 0, high = int(stk.size()) - 1, id = n;
        while (low <= high) {
          int mid = low + high >> 1;
          if (a[stk[mid]] > a[i]) {
            id = stk[mid];
            low = mid + 1;
          } else {
            high = mid - 1;
          }
        }
        R[i] = id;
        if (del[a[i]]) {
          while (!stk.empty() && a[stk.back()] < a[i]) {
            stk.pop_back();
          }
          stk.push_back(i);
        }
      }
    }
    vector<int> order(n);
    iota(order.begin(), order.end(), 0);
    sort(order.begin(), order.end(), [&](int i, int j) {
      return a[i] > a[j];
    });
    vector<int> fenw(n);
    auto Modify = [&](int p, int v) {
      while (p < n) {
        fenw[p] += v;
        p |= (p + 1);
      }
    };
    auto Query = [&](int p) {
      int v = 0;
      while (p >= 0) {
        v += fenw[p];
        p = (p & (p + 1)) - 1;
      }
      return v;
    };
    for (int i = 0; i < n; i++) {
      Modify(i, +1);
    }
    bool ok = true;
    for (int i : order) {
      if (del[a[i]]) {
        continue;
      }
      int need = Query(R[i] - 1) - Query(L[i]);
      Modify(i, -1);
      auto it = st.lower_bound(need + 1);
      if (it == st.begin()) {
        ok = false;
        break;
      }
      it = prev(it);
      st.erase(it);
    }
    cout << (ok ? "YES" : "NO") << '\n';
  }
  return 0;
}