#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include <cp/debugger.hpp>
#else
#define debug(...) 42
#endif

#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()

typedef int64_t int64;
typedef pair<int, int> ii;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int tt;
  cin >> tt;
  while (tt--) {
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> a(n), pos(n);
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      a[i]--;
      pos[a[i]] = i;
    }
    vector<int> b(m);
    for (int &e : b) cin >> e, e--;
    vector<int> l(k);
    for (int &e : l) cin >> e;
    bool ok = true;
    for (int i = 1; i < m; i++) {
      ok &= (pos[b[i - 1]] < pos[b[i]]);
    }
    vector<int> left(n), right(n);
    {
      stack<int> st;
      for (int i = 0; i < n; i++) {
        while (!st.empty() && a[st.top()] < a[i]) st.pop();
        left[i] = (st.empty() ? -1 : st.top());
        st.push(i);
      }
    }
    {
      stack<int> st;
      for (int i = n - 1; i >= 0; i--) {
        while (!st.empty() && a[st.top()] < a[i]) st.pop();
        right[i] = (st.empty() ? n : st.top());
        st.push(i);
      }
    }
    vector<int> in_b(n);
    for (int e : b) in_b[e] = 1;
    
    vector<int> all_lens;
    for (int i = 0; i < n; i++) {
      if (in_b[a[i]]) continue;
      int len = right[i] - left[i] - 1;
      all_lens.push_back(len);
    }
    sort(l.begin(), l.end());
    sort(all_lens.begin(), all_lens.end());
    int cur = 0;
    if (sz(l) < sz(all_lens)) {
      ok = false;
    } else {
      for (int i = 0; i < sz(all_lens); i++) {
        ok &= (l[i] <= all_lens[i]);
      }
    }
    cout << (ok ? "YES\n" : "NO\n");
  }
  
  return 0;
}