#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int q; cin >> q;
	while (q--) {
		int n, m; cin >> n >> m;
		vector<P>gs(m);
		int g0 = 0, gn = 0, g00 = 0, gnn = 0;
		rep(i, m) cin >> gs[i].second;
		rep(i, m) {
			cin >> gs[i].first;
			if (gs[i].first == 0 && gs[i].second != 0)g0++;
			if (gs[i].first == 0 && gs[i].second == 0)g00++;
			if (gs[i].first == n - 1 && gs[i].second != n - 1)gn++;
			if (gs[i].first == n - 1 && gs[i].second == n - 1)gnn++;
		}
		if ((g0 && g00) || (gn && gnn) || g0 >= 2 || gn >= 2) {
			cout << "No" << endl;
			continue;
		}
		sort(all(gs));
		bool chk = true;
		rep(i, m - 1) {
			if (gs[i].second > gs[i + 1].second)chk = false;
		}
		cout << (chk ? "Yes" : "No") << endl;
	}
	return 0;
}