#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

// https://github.com/shingo0909/kyopro/blob/39029fab39c1735c38e5e9e4494d9934f81d6918/Library/compress.cpp

template <typename... Vectors>
auto compress(Vectors... vecs) {
    vector<int> b;
    (b.insert(b.end(), vecs.begin(), vecs.end()), ...);
    sort(b.begin(), b.end());
    // b.erase(unique(b.begin(), b.end()), b.end());

    auto enc = [&](vector<int> a) {
        vector<int> res(a.size());
        for (int i = 0; i < (int)a.size(); i++) {
            res[i] = lower_bound(b.begin(), b.end(), a[i]) - b.begin();
        }
        return res;
    };

    return make_tuple(enc(vecs)...);
}

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--) {
        int n, m;
        cin >> n >> m;
        vector<int> s(m);
        vector<int> g(m);
        rep(i, m) cin >> s[i];
        rep(i, m) cin >> g[i];
        tie(s) = compress(s);
        tie(g) = compress(g);
        bool ok = true;
        rep(i, m) {
            if (s[i] > g[i]) {
                ok = false;
            }
        }
        cout << (ok ? "Yes" : "No") << endl;
    }
    return 0;
}