1
2 2
1 1
1 2
 1
1 3
3
1 2 3
 1
1 1
1000
1000
 1
2 2
2 2
2 2
 5
4 5
10 8 6 4
1 2 3 4 5
1 1
3
3
1 1
3
2
5 3
1000 2 2 2 3
3 1 5
5 5
1 2 3 4 5
1 2 3 4 5
 1
4 4
1 1 1 1
1 2 3 4
 1
2 3
1 1
1 2 3

YES
1 1
 YES
1 3
 YES
1 1000
 YES
1 2
 YES
1 4
YES
1 3
NO
YES
1 3
YES
1 1
 YES
1 1
 YES
1 1

t=int(input())

def bin_search(l1,l, num):
    beg=0
    end=l
    while beg<=end:
        mid=(beg+end)//2
        if l1[mid]<num:
            beg=mid+1
        elif l1[mid]>num:
            end=mid-1
        else:
            return l1[mid]

    if num==l1[0]:
        return l1[0]
    
    return -1


while t:
    n,m=map(int, input().split())
    a=list(map(int, input().split()))
    b=list(map(int, input().split()))
    # print (a)

    for i in b:
        if i in a:
            print ("YES")
            print (1, i)
            break
    else:
        print ("NO")




    t=t-1