5

3 2 2
2 0
0 5

4 3 2
2 0 5
0 6

0 2 2
1 0
2 3

5 4 4
6 0 8 0
0 7 0 9

5 4 1
8 7 8 0
0

0 2 0 5
0 2 0 5 6
-1
0 6 0 7 0 8 0 9
-1

# link: https://codeforces.com/contest/1547/problem/C

import os, sys
from io import BytesIO, IOBase
 
BUFSIZE = 8192
 
 
class FastIO(IOBase):
    newlines = 0
 
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
 
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
 
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
 
 
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
 
 
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
from math import ceil
mod = 10 ** 9 + 7 

# number of test cases
for _ in range(int(input())):
    input()
    k,n,m = map(int, input().split())
    mono = list(map(int, input().split()))
    poly = list(map(int, input().split()))
    order = []
    i,j = 0,0
    flag = 0
    while (i < n) or (j < m):
        if (i < n) and (j < m):
            if mono[i] == 0 and poly[i] == 0:
                k += 2
                i += 1
                j += 1
                order.append(0)
                order.append(0)
            elif mono[i] == 0:
                k += 1
                i += 1
                order.append(0)
                if poly[j] <= k:
                    order.append(poly[j])
                    j += 1
                else:
                    flag = 1
                    break
            elif poly[j] == 0:
                k += 1
                j += 1
                order.append(0)
                if mono[i] <= k:
                    order.append(mono[i])
                    i += 1
                else:
                    flag = 1
                    break        
            else: # mono[i] and poly[j] both are values greater than 0
                if mono[i] <= k and poly[j] <= k:
                    order.append(mono[i])
                    order.append(poly[j]) 
                    i += 1
                    j += 1
                else:
                    flag = 1
                    break
        elif (i < n):
            if mono[i] == 0:
                k += 1
                i += 1
                order.append(0)
            elif mono[i] != 0 and mono[i] <= k:
                order.append(mono[i])          
                i += 1
            else:
                flag = 1
                break
        elif (j < m):
            if poly[j] == 0:
                order.append(0)
                k += 1
                j += 1
            elif poly[j] != 0 and poly[j] <= k:
                order.append(poly[j])
                j += 1
            else:
                flag = 1
                break
    if flag == 1:
        print(-1)
    else:
        print(*order)                                              
