# haru: pypy
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right

from random import shuffle


def solve():
    n = II()
    r = LI()
    c = LI()
    # 最貧がしてい
    
    if n == 1:
        print(1)
        return
    
    if n == 2:
        print(-1)
        return
    
    a = [[0] * n for i in range(n)]
    
    for i in range(n):
        for j in range(n):
            a[i][j] = r[i]
    if len(set(c)) == 1:
        # すべて同じ
        if n <= 4:
            print(-1)
            return
        
        
        # n >= 5 のときは？
        
        
        x = c[0]
        idx = r.index(x)
        ch = [i for i in range(n) if i != idx]
        ch += [ch[0]]
        
    else:
        
        ch = list(range(n))
        while True:
            shuffle(ch)
            
            for i in range(n):
                if r[ch[i]] == c[j]:
                    break
            else:
                break
        
    for j in range(n):
        a[ch[j]][j] = c[j]
        
        
    
    for i in range(n):
        print(*a[i])



t = II()
for i in range(t):
    solve()