#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int t;
  cin >> t;
  while (t--)
  {
    int n, m;
    cin >> n >> m;
    vector<int> a(m), b(m);
    for (int i = 0; i < m; ++i) cin >> a[i];
    for (int i = 0; i < m; ++i) cin >> b[i];
    vector<pair<int, int>> ab(m);
    for (int i = 0; i < m; ++i) ab[i] = {a[i], b[i]};
    sort(ab.begin(), ab.end());
    int ans = 1;
    for (int i = 1; i < m; ++i)
    {
      if (ab[i - 1].second > ab[i].second || (ab[i].first != ab[i - 1].first && ab[i].second == ab[i - 1].second)) ans = 0;
    }
    cout << (ans ? "Yes" : "No") << endl;
  }
}