description: You are given two arrays of integers a_1, a_2, …, a_n and b_1, b_2, …, b_m.
  
  You need to insert all elements of b into a in an arbitrary way. As a result you will get an array c_1, c_2, …, c_{n+m} of size n + m.
  
  Note that you are not allowed to change the order of elements in a, while you can insert elements of b at arbitrary positions. They can be inserted at the beginning, between any elements of a, or at the end. Moreover, elements of b can appear in the resulting array in any order.
  
  What is the minimum possible number of inversions in the resulting array c? Recall that an inversion is a pair of indices (i, j) such that i < j and c_i > c_j.
  
  Input
  
  Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 10^4). Description of the test cases follows.
  
  The first line of each test case contains two integers n and m (1 ≤ n, m ≤ 10^6).
  
  The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9).
  
  The third line of each test case contains m integers b_1, b_2, …, b_m (1 ≤ b_i ≤ 10^9).
  
  It is guaranteed that the sum of n for all tests cases in one input doesn't exceed 10^6. The sum of m for all tests cases doesn't exceed 10^6 as well.
  
  Output
  
  For each test case, print one integer — the minimum possible number of inversions in the resulting array c.
  
  Example
  
  Input
  
  
  3
  3 4
  1 2 3
  4 3 2 1
  3 3
  3 2 1
  1 2 3
  5 4
  1 3 5 3 1
  4 3 6 1
  
  
  Output
  
  
  0
  4
  6
  
  Note
  
  Below is given the solution to get the optimal answer for each of the example test cases (elements of a are underscored).
  
    * In the first test case, c = [\underline{1}, 1, \underline{2}, 2, \underline{3}, 3, 4]. 
    * In the second test case, c = [1, 2, \underline{3}, \underline{2}, \underline{1}, 3]. 
    * In the third test case, c = [\underline{1}, 1, 3, \underline{3}, \underline{5}, \underline{3}, \underline{1}, 4, 6]. 
solution: #include <bits/stdc++.h>
  using namespace std;
  char buf[1 << 18], *p1 = buf, *p2 = buf;
  int read() {
    char c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 18, stdin)),
              p1 == p2 ? EOF : *p1++);
    int x = 0;
    while (c < 48 || c > 57)
      c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 18, stdin)),
           p1 == p2 ? EOF : *p1++);
    do
      x = (x << 1) + (x << 3) + (c ^ 48),
      c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 18, stdin)),
           p1 == p2 ? EOF : *p1++);
    while (c >= 48 && c <= 57);
    return x;
  }
  const int _ = 1000003;
  int n, m, tp;
  int a[_], b[_], c[_ << 1], d[_ << 1];
  void dvs(int l, int r, int L, int R) {
    if (l > r) {
      for (int i = L; i < R; i++) c[++tp] = a[i];
      return;
    }
    if (L >= R) {
      for (int i = l; i <= r; i++) c[++tp] = b[i];
      return;
    }
    int mid = (l + r) >> 1, sm = 0;
    for (int i = L; i < R; i++) sm += a[i] > b[mid];
    int mx = sm, p = R;
    for (int i = R - 1; i >= L; i--) {
      if (a[i] < b[mid]) sm++;
      if (a[i] > b[mid]) sm--;
      if (sm < mx) mx = sm, p = i;
    }
    dvs(l, mid - 1, L, p);
    c[++tp] = b[mid];
    dvs(mid + 1, r, p, R);
  }
  long long srt(int *e, int l, int r) {
    if (l == r) return 0;
    int mid = (l + r) >> 1;
    long long res = 0;
    res += srt(e, l, mid);
    res += srt(e, mid + 1, r);
    int s1 = l, s2 = mid + 1, s3 = l;
    while (s1 <= mid && s2 <= r) {
      if (c[s1] <= c[s2])
        d[s3++] = e[s1++];
      else
        res += mid - s1 + 1, d[s3++] = e[s2++];
    }
    for (int i = s1; i <= mid; i++) d[s3++] = e[i];
    for (int i = s2; i <= r; i++) d[s3++] = e[i];
    for (int i = l; i <= r; i++) e[i] = d[i];
    return res;
  }
  void solve() {
    while (tp) c[tp--] = 0;
    n = read();
    m = read();
    for (int i = 1; i <= n; i++) a[i] = read();
    for (int i = 1; i <= m; i++) b[i] = read();
    sort(b + 1, b + m + 1);
    dvs(1, m, 1, n + 1);
    printf("%lld\n", srt(c, 1, n + m));
  }
  int main() {
    int T = read();
    while (T--) solve();
    return 0;
  }
  