from collections import Counter


def solve():
	N = int(input())
	R = list(map(int,input().split()))
	C = list(map(int,input().split()))

	cntC = Counter(C)
	uni_val = []
	mul_val = []
	for v,c in cntC.items():
		if c == 1:
			uni_val.append(v)
		else:
			mul_val.append(v)
	smul = set(mul_val)
	pR = [None]*(N+1)
	uL = len(uni_val)
	mul_vidx = []
	uni_vidx = []
	for i in range(N):
		if C[i] in smul:
			mul_vidx.append((C[i], i))
		else:
			uni_vidx.append((C[i], i))

	
	for i in range(N):
		pR[R[i]] = i
	# print(pR)
	grid = [[R[i]]*N for i in range(N)]
	rowidxs = []
	for v,jdx in uni_vidx:
		rowidx = (pR[v] + 1) % N
		rowidxs.append(rowidx)
		grid[rowidx][jdx] = v
	use = set([i for i in range(N)])
	for idx in rowidxs: use.discard(idx)
	for v in mul_val:
		use.discard(pR[v])
	use = list(use)
	# print(use)
	mL = len(mul_vidx)
	off = 0
	# print(mul_vidx)
	appear = set()
	for nowidx, (v, jdx) in enumerate(mul_vidx):
		# print(v, jdx)
		# print(use[nowidx])
		if use[nowidx % len(use)] == pR[v] and not v in appear:
			# off += 1
			appear.add(v)
		grid[(use[nowidx % len(use)] + off) % N][jdx] = v
	# print
	# for i in range(N):
	# 	for j in range(N):
	# 		print(grid[i][j],end=" ")
	# 	print()
		
	# valid_check 
	for i in range(N):
		cnt = Counter(grid[i])
		most = cnt.most_common()
		# 最大性
		if R[i] == most[0][0]:
			# 唯一性
			if len(most)>1 and most[0][1] == most[1][1]:
				print(-1)
				return
		else:
			print(-1)
			return
	for j in range(N):
		ncol = []
		for i in range(N):
			ncol.append(grid[i][j])
		cnt = Counter(ncol)
		most = cnt.most_common()
		# 最大性
		if C[j] == most[0][0]:
			# 唯一性
			if len(most)>1 and most[0][1] == most[1][1]:
				print(-1)
				return
		else:
			print(-1)
			return
	# print
	for i in range(N):
		for j in range(N):
			print(grid[i][j],end=" ")
		print()






T = int(input())
for _ in range(T):
	solve()


"""
1
6
1 2 3 4 5 6
1 1 1 1 1 1
"""