#include <bits/stdc++.h>

using namespace std;

void solve()
{
    int n, m;
    cin >> n >> m;
    vector <int> a(n);
    vector <int> pos(n, 0);
    for (int i = 0; i < n; ++i)
    {
        cin >> a[i];
    }
    vector <int> v = a;
    sort(v.begin(), v.end());
    for (int i = 0; i < m; ++i)
    {
        int x; cin >> x;
        pos[x-1] = 1;
    }
    int hh = 0;
    while(hh != n*n)
    {
        for (int i = 0; i < n-1; ++i)
        {
            if (pos[i] && a[i] > a[i+1])
            {
                swap(a[i], a[i+1]);
                break;
            }
        }
        ++hh;
    }
    cout << ((a == v) ? "YES" : "NO") << endl;
}

int main()
{
    int t; cin >> t;
    while(t--) solve();
}