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 cs():
    for i in range(int(input())):
        success=0
        hasha=[0 for x in range(1001)]
        hashb=[0 for x in range(1001)]
        s1=input().split()
        (n,m)=(int(s1[0]),int(s1[1]))
        a=[int(x) for x in input().split()]
        b=[int(x) for x in input().split()]
        for j in range(n):
            hasha[a[j]]=hashb[a[j]]+1
        for r in range(m):
            hashb[b[r]]=hashb[b[r]]+1
        for k in range(1001):
            if hasha[k]>=1 and hashb[k]>=1:
                print("YES")
                print(1,k)
                success=1
                break
        if success==0:
            print("NO")

cs()

