/* Problem URL: https://codeforces.com/contest/2164/problem/C */

#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, m;
    cin >> n >> m;

    priority_queue<ll, vl, greater<>> a;
    rep(i, n) {
        ll now;
        cin >> now;
        a.push(now);
    }
    V<pair<ll, ll>> c(m);

    rep(i, m) {
        cin >> c[i].first;
    }

    rep(i, m) {
        cin >> c[i].second;
    }
    sortv(c);

    int ans = 0;
    priority_queue<ll, vl, greater<>> swo;
    priority_queue<ll, vl, greater<>> mom;
    priority_queue<ll> at;
    int cur = 0;
    while (cur < m && !a.empty()) {
        if (c[cur].second == 0) {
            mom.push(c[cur].first);
            cur++;
            continue;
        }

        if (a.top() < c[cur].first) {
            if (!at.empty()) {
                auto now = a.top();
                a.pop();
                a.push(max(now, at.top()));
                at.pop();
                ans++;
                continue;
            }

            swo.push(a.top());
            a.pop();
            continue;
        }

        at.push(c[cur].second);
        cur++;
    }

    while (!at.empty() && !a.empty()) {
        auto now = a.top();
        a.pop();
        a.push(max(now, at.top()));
        at.pop();
        ans++;
    }

    if (a.size() > swo.size()) {
        swap(a, swo);
    }

    while (!a.empty()) {
        swo.push(a.top());
        a.pop();
    }

    while (!swo.empty() && !mom.empty()) {
        if (swo.top() < mom.top()) {
            swo.pop();
            continue;
        }

        ans++;
        swo.pop();
        mom.pop();
    }

    cout << ans << '\n';
}

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

    pre();

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