#include<bits/stdc++.h>
using namespace std; 
char nl = '\n';
using i64 = long long;

void solve(int t) {
    // cout << "test #" << t << << nl;
    int n; cin >> n;
    vector<int> A(n), B(n);
    for(auto& a : A) cin >> a;
    for(auto& b : B) cin >> b;
    vector<array<int, 2>> ans(n);

    // nxt[i] will store the end index of the longest segment which cotains i 
    vector<int> nxt(n);
    nxt[n - 1] = n - 1;
    for(int i = n - 2; i >= 0; i--) {
        if(B[i] >= A[i + 1]) nxt[i] = nxt[i + 1]; // checking if the condition is still valid
        else nxt[i] = i; // start a new segment if condition violates
    }
    // ans[i][0] -> min di
    // ans[i][0] -> max di
    for(int i = 0; i < n; i++) {
        ans[i][0] = *lower_bound(B.begin(), B.end(), A[i]) - A[i];
        ans[i][1] = B[nxt[i]] - A[i];
    }
    for(auto& a : ans) cout << a[0] << " "; cout << nl;
    for(auto& a : ans) cout << a[1] << " "; cout << nl;
} 

int main() {
    int tt = 1;
    cin >> tt;
    for(int t = 1; t <= tt; t++) solve(t);
}