CodeForces 1883G1 Dances (Easy version)

// Date: Wed Dec 27 15:26:41 2023

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <climits>

#include <iostream>
#include <iomanip>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <utility>
#include <functional>

using namespace std;

const int INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const double eps = 1e-8;
const int dir[8][2] = {
{0, 1}, {0, -1},
{1, 0}, {-1, 0},
{1, 1}, {1, -1},
{-1, 1}, {-1, -1},
};

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef pair<int, int> PII;

const ull Pr = 131;

#define For(i, a, b) for (int i = int(a); i < int(b); ++i)
#define Rof(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
#define For1(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define Rof1(i, a, b) for (int i = int(b); i >= int(a); --i)
#define ForE(i, j) for (int i = h[j]; i != -1; i = ne[i])

#define f1 first
#define f2 second
#define pb push_back
#define has(a, x) (a.find(x) != a.end())
#define nonempty(a) (!a.empty())
#define all(a) (a).begin(),(a).end()
#define SZ(a) int((a).size())

template <typename t> istream &operator>>(istream &in, vector<t> &vec) {
    for (t &x : vec)
        in >> x;
    return in;
}

template <typename t> ostream &operator<<(ostream &out, vector<t> &vec) {
    int n = SZ(vec);
    For(i, 0, n) {
        out << vec[i];
        if (i < n - 1)
            out << ' ';
    }
    return out;
}

#ifdef _DEBUG
#define debug1(x) cout << #x" = " << x << endl;
#define debug2(x,y) cout << #x" = " << x << " "#y" = " << y << endl;
#define debug3(x,y,z) cout << #x" = " << x << " "#y" = " << y << " "#z" = " << z << endl;
#else
#define debug1
#define debug2
#define debug3
#endif


const int N = 100010;
int n, m, a[N], b[N], t;

int solve(int x, int l) {
    int r = n, mid;
    if (l > r) return -1;

    while (l < r) {
        mid = (l + r) / 2;
        if (b[mid] > x) r = mid;
        else l = mid + 1;
    }
    if (b[r] > x) return r;
    return -1;
}

int main(void)
{
#ifdef _DEBUG
    freopen("1883g1.in", "r", stdin);
#endif
    std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    cin >> t;

    while (t--) {
        cin >> n >> m;

        a[1] = 1;
        For1(i, 2, n) cin >> a[i];
        For1(i, 1, n) cin >> b[i];

        sort(a + 1, a + 1 + n);
        sort(b + 1, b + 1 + n);

        int res = 0, l = 1;
        For1(i, 1, n) {
            int pos = solve(a[i], l);
            if (pos == -1) {
                res = n - i + 1;
                break;
            }
            l = pos + 1;
        }
        cout << res << '\n';
    }

    return 0;
}