/**
	author:  shobonvip
	created: 2026.09.19 17:17:40
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

void solve() {
	int n; cin >> n;


	vector<int> r(n), c(n);
	rep(i,0,n) {
		cin >> r[i];
		r[i]--;
	}
	rep(i,0,n) {
		cin >> c[i];
		c[i]--;
	}

	if (n == 1) {
		cout << 1 << '\n';
		return;
	}

	if (n <= 2) {
		cout << -1 << '\n';
		return;
	}

	if (min(c) == max(c)) {
		cout << -1 << '\n';
		return;
	}

	vector ans(n, vector<int>(n,-1));
	rep(i,0,n) {
		rep(j,0,n) {
			if (r[i] == c[j]) {
				ans[i][j] = r[i];
			}
		}
	}

	mf_graph<int> mf(2*n+2);
	int S = 2*n, T = 2*n+1;
	rep(i,0,n) {
		rep(j,0,n) {
			if (ans[i][j] == -1) {
				mf.add_edge(i, n+j, 1);
			}	
		}
	}
	rep(i,0,n) {
		mf.add_edge(S, i, 1);
		mf.add_edge(i+n, T, 1);
	}

	mf.flow(S, T);
	for (auto &e: mf.edges()) {
		if (e.from < n && n <= e.to && e.to < 2*n && e.flow == 1) {
			ans[e.from][e.to-n] = c[e.to-n];
		}
	}
	rep(i,0,n) {
		rep(j,0,n) {
			if (ans[i][j] == -1) ans[i][j] = r[i];
		}
	}

	rep(i,0,n) {
		rep(j,0,n) {
			cout << ans[i][j] + 1;
			if (j == n-1) cout << '\n';
			else cout << ' ';
		}

	}

}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int t; cin >> t;
	while (t--) solve();
}