第一问求 $d_{min}$ 很简单，只需要把 $b$ 排序，然后对 $a_i$ 找到最小的 $b_i \ge a_i$ 即可。

第二问很有意思，对于 $a_i$，需要找到尽量大的 $b_j \ge a_i$，同时满足 $a_{i+1}, \ldots, a_n$ 都能找到对应的匹配，同时尽可能小。我们可以对于每个 $a_j (j \ge i+1)$ 都找到最小的 $b_j \ge a_j$，然后从数组中删除这些 $b_j$，此时数组中剩余的最大值就可以匹配 $a_i$。我们可以发现，这样做不会让 $a_{i - 1}$ 的结果变差，在这个基础上，删除掉 $\ge a_i$ 的最小的 $b_j$ 之后，这恰好是 $a_{i - 1}$ 想要的 $b$ 数组。因此可以从右往左处理。

// Date: Fri Feb  2 23:06:22 2024

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

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

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;

const int INF = 0x3f3f3f3f, MOD = 1e9 + 7, MOD1 = 998'244'353;
const ll INFL = 0x3f3f3f3f'3f3f3f3f;
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},
};

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 nemp(a) (!a.empty())
#define all(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())
#define NL cout << '\n';

template <class T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

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;
}

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template <typename T, typename V> void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ", ";
  __print(x.second);
  cerr << '}';
}
template <typename T> void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x)
    cerr << (f++ ? ", " : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v))
    cerr << ", ";
  _print(v...);
}

#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;
#define dbg(x...)                                                              \
  cerr << "\e[91m" << __func__ << ":" << __LINE__ << " [" << #x << "] = [";    \
  _print(x);                                                                   \
  cerr << "\e[39m" << endl;
#else
#define debug1
#define debug2
#define debug3
#define dbg(x...)
#endif

const int N = 200100;

int n, a[N], b[N], d[N], d1[N];
multiset<int> s;

void solve() {
  cin >> n;
  For1(i, 1, n) { cin >> a[i]; }
  sort(a + 1, a + 1 + n);
  s.clear();
  For1(i, 1, n) {
    cin >> b[i];
    s.insert(b[i]);
  }
  sort(b + 1, b + 1 + n);
  For1(i, 1, n) {
    int l = 1, r = n, mid;
    while (l < r) {
      mid = (l + r) / 2;
      if (b[mid] >= a[i])
        r = mid;
      else
        l = mid + 1;
    }
    d[i] = r;
  }
  For1(i, 1, n) cout << b[d[i]] - a[i] << ' ';
  NL;

  Rof1(i, 1, n) {
    auto it = s.lower_bound(a[i]);
    d1[i] = *prev(s.end()) - a[i];
    s.erase(it);
  }

  For1(i, 1, n) cout << d1[i] << ' ';
  NL;
}

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

  int T = 1;
  cin >> T;

  while (T--) {
    solve();
  }

  return 0;
}