from collections import deque
for i in range(int(input())):
    n,m=map(int,input().split())
    a=list(map(int,input().split()))
    b=list(map(int,input().split()))
    a.sort()
    b.sort()
    suma=sum(a[-m::])
    sumb=sum(b)
    k=sumb-suma
    if k<0:
        print(-1)
        continue
    
    ms=a[-m::]
    minmi=0
    res=[]
    if n-m>k:        #tk 为总和差值，cz为总操作数
        cz=n-m
        tk=k+0
        xl=deque(a[0:-m])
        while cz>tk and xl:
            if xl[0]>ms[0]:
                cz-=1
                res.append(xl.popleft())
        for i in range(m-1,-1,-1):
            if ms[i]<=b[i]:
                for j in range(b[i]-ms[i]):
                    res.append(ms[i])
                    ms[i]+=1
            else:
                res=-1
                break 
            
            
            
    elif n-m==k:
        for i in range(m-1,-1,-1):
            if ms[i]<=b[i]:
                for j in range(b[i]-ms[i]):
                    res.append(ms[i])
                    ms[i]+=1
            else:
                res=-1
                break          
    elif n-m<k:
        print(-1)
        continue
    print(*res)