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

def binarySearch (arr, l, r, x): 
    if r >= l: 
        mid = l + (r - l) // 2
        if arr[mid] == x: 
            return True 
        elif arr[mid] > x: 
            return binarySearch(arr, l, mid-1, x) 
        else: 
            return binarySearch(arr, mid + 1, r, x) 
    else:
        return False
a=int(input())
for i in range(a):
    a1=list(map(int,input().split()))
    ar1=list(map(int,input().split()))
    ar2=list(map(int,input().split()))
    ar1.sort()
    ar2.sort()
    num=0
    flag=0
    for i in ar1:
        if(binarySearch(ar2,0,len(ar2)-1,i)==True):
            flag=1
            num=i
            break
    if(flag==1):
        print("YES")
        print("1",num)
    else:
        print("NO")