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

n=int(input())
for _ in range(n):
    a,b=map(int,input().split())
    ar=sorted(map(int,input().split()))
    ar1=sorted(map(int,input().split()))
    t=min(len(ar),len(ar1))
    ans=0;count=0
    for i in range(t):
        if len(ar)<=len(ar1):
            if ar[i] in ar1:
                ans=ar[i]
                count=1
                break
        else:
            if ar1[i] in ar:
                ans=ar1[i]
                count=1
                break
    if count==1:
        print("YES")
        print(1,ans)
    else:
        print("NO")