#include <bits/stdc++.h>   using namespace std;   int a[123], p[123];   signed main() {     int t;     scanf( %d , &t);     while (t--) {       int n, m;       scanf( %d %d , &n, &m);       memset(p, 0, sizeof(p));       for (int i = 1; i <= n; ++i) scanf( %d , a + i);       for (int i = 1, x; i <= m; ++i) scanf( %d , &x), p[x] = 1;       bool ok = 1;       for (int i = 1; i <= n; ++i)         for (int j = i + 1; j <= n; ++j) {           if (!ok) break;           if (a[i] > a[j])             for (int k = i; k < j; ++k)               if (!p[k]) {                 ok = 0;                 break;               }         }       ok ? puts( YES ) : puts( NO );     }     return 0;   }   