#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)
template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

void solve() {
	int n, m;
	cin >> n >> m;
	vector<int> s(m), g(m);
	rep(i, 0, m) cin >> s[i];
	rep(i, 0, m) cin >> g[i];
	vector<pair<int, int>> vp(m);
	rep(i, 0, m) vp[i] = {s[i], g[i]};
	sort(all(vp));
	rep(i, 0, m - 1) {
		if (vp[i].second > vp[i + 1].second) {
			cout << "No\n";
			return;
		}
		if (vp[i].second == vp[i + 1].second) {
			if (vp[i].first == vp[i].second && vp[i] == vp[i + 1]) {
			} else {
				cout << "No\n";
				return;
			}
		}
	}
	cout << "Yes\n";
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	int t = 1;
	cin >> t;
	while (t--) solve();
}