/* Problem URL: https://codeforces.com/contest/2211/problem/C2 */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

const int oo = INT32_MAX >> 1;
const ll OO = INT64_MAX >> 1;


void pre()
{

}

#define TEST 1

void solve()
{
    int n, k;
    cin >> n >> k;

    vi a(n);
    vi b(n);
    cin >> a >> b;

    auto test = [&]() {
        multiset<int> s;
        int c = 0;
        rep(i, k) {
            if (b[i] == -1) {
                c++;
                continue;
            }

            s.insert(b[i]);
        }

        rep(i, k) {
            if (s.find(a[i]) == s.end()) {
                if (c) {
                    c--;
                    continue;
                }

                return false;
            }

            s.erase(s.find(a[i]));
        }

        return true;
    };

    if (!test()) {
        cout << "NO\n";
        return;
    }

    V<V<pair<int, int>>> vec(k);

    for (int i = 0; i < n; i++) {
        vec[i % k].emplace_back(a[i], b[i]);
    }

    vi c1(n);
    vi c2(n);

    repv(now, vec) {
        set<int> c;
        repv(j, now) {
            c.insert(j.first);
        }

        if (c.size() == 1) {
            c1[*c.begin() - 1]++;
            set<int> ot;
            repv(j, now) {
                if (j.second == -1) {
                    continue;
                }
                ot.insert(j.second);
            }

            if (ot.empty()) {
                continue;
            }

            if (ot.size() > 1) {
                cout << "NO\n";
                return;
            }

            c2[*ot.begin() - 1]++;
            continue;
        }

        repv(j, now) {
            if (j.second != -1 && j.second != j.first) {
                cout << "NO\n";
                return;
            }
        }
    }

    rep(i, n) {
        if (c2[i] > c1[i]) {
            cout << "NO\n";
            return;
        }
    }

    cout << "YES\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    pre();

    int t;
    (TEST && cin >> t) || (t = 1);
    while (t--) {
        solve();
    }
}