#include <set>
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define dep(i, l, r) for (int i = r; i >= l; --i)
const int N = 2e5 + 5;
int n, m, c, T, ok;
int a[N], b[N], z[N], l[N], r[N], id[N], pos[N]; 
multiset <int> S; 

namespace ST {
  #define ls (p << 1)
  #define rs (p << 1 | 1)
  #define mid ((l + r) >> 1)
  struct node { int mi, mx; } t[N << 2]; 
  
  void build (int p, int l, int r) {
    t[p].mi = n + 1, t[p].mx = 0; 
    if(l == r) return ; 
    build(ls, l, mid), build(rs, mid + 1, r); 
  }
  void update (int p, int l, int r, int x, int k) {
    t[p].mi = min(t[p].mi, k); 
    t[p].mx = max(t[p].mx, k); 
    if(l == r) return ; 
    if(mid >= x) update(ls, l, mid, x, k) ;
    if(mid < x) update(rs, mid + 1, r, x, k); 
  }
  int qmax (int p, int l, int r, int x, int y) {
    if(x > y) return 0; 
    if(l >= x && r <= y) return t[p].mx; 
    int ans = 0; 
    if(mid >= x) ans = max(ans, qmax(ls, l, mid, x, y)); 
    if(mid < y) ans = max(ans, qmax(rs, mid + 1, r, x, y)); 
    return ans; 
  }
  int qmin (int p, int l, int r, int x, int y) {
    if(x > y) return n + 1; 
    if(l >= x && r <= y) return t[p].mi; 
    int ans = n + 1; 
    if(mid >= x) ans = min(ans, qmin(ls, l, mid, x, y)); 
    if(mid < y) ans = min(ans, qmin(rs, mid + 1, r, x, y)); 
    return ans; 
  }
}

namespace FT {
  int c1[N];
  long long c2[N]; 

  void reset () {
    rep(i, 1, n) c1[i] = c2[i] = 0; 
  }
  void add (int p, int k) {
    for (int i = p; i <= n; i += (i & (-i)))
      c1[i] += k, c2[i] += p * k; 
  }
  int qry (int p) {
    int ans1 = 0, ans2 = 0; 
    for (int i = p; i; i -= (i & (-i)))
      ans1 += c1[i], ans2 += c2[i]; 
    return 1ll * ans1 * (p + 1) - ans2; 
  }
  int qry (int l, int r) {
    return l > r ? 0 : qry(r) - qry(l - 1); 
  }
}

int main () {
  ios :: sync_with_stdio(0), cin.tie(0), cout.tie(0); 
  cin >> T;
  while (T--) {
    cin >> n >> m >> c, ok = 1; 
    rep(i, 1, n) cin >> a[i], pos[a[i]] = i;
    rep(i, 1, m) cin >> b[i]; 
    rep(i, 1, c) cin >> z[i]; 
    rep(i, 2, m) if(pos[b[i - 1]] > pos[b[i]]) { ok = 0; break ; }
    if(!ok || n - c > m) { puts("NO"); continue ; }
    S.clear(); 
    rep(i, 1, c) S.insert(z[i]); 
    rep(i, 1, n) l[i] = 0, r[i] = n + 1; 
    ST :: build(1, 1, n); 
    rep(i, 1, n) id[i] = 0; 
    rep(i, 1, m) id[b[i]] = 1; 
    m = 0; 
    rep(i, 1, n) if(!id[a[i]]) b[++m] = a[i]; 
    rep(i, 1, n) {
      l[i] = ST :: qmax(1, 1, n, a[i] + 1, n);
      if(id[a[i]]) ST :: update(1, 1, n, a[i], i); 
    }
    ST :: build(1, 1, n); 
    dep(i, 1, n) {
      r[i] = ST :: qmin(1, 1, n, a[i] + 1, n);
      if(id[a[i]]) ST :: update(1, 1, n, a[i], i); 
    }
    sort(b + 1, b + m + 1, [](int x, int y) { return x > y; }); 
    FT :: reset(); 
    rep(i, 1, m) {
      int x = pos[b[i]]; 
      ++l[x], --r[x]; 
      int len = r[x] - l[x] + 1 - FT :: qry(l[x], r[x]);
      auto it = S.upper_bound(len); 
      if(it != S.end() && *it == *S.begin()) { ok = 0; break ; }
      --it, S.erase(it); 
      FT :: add(x, 1);   
    }
    if(ok) puts("YES"); 
    else puts("NO"); 
  }
  return 0; 
}