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 intersection(alist: list, blist: list) -> int:
    for ele in alist:
        if ele in blist:
            return ele
    return -1


t = int(input())

AList = list(list())
BList = list(list())
for _ in range(t):
    __ = input()
    a = list(map(int, input().split()))
    b = list(map(int, input().split()))
    AList.append(a)
    BList.append(b)

for i in range(len(AList)):
    k = intersection(AList[i], BList[i])

    if k != -1:
        print("Yes")
        print(1, k)
    else:
        print("No")
