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 solution(arr1,arr2):
    d = {}
    for i in arr1 :
        d[i] = d.get(i,0) + 1 
    
    ans = []
    for j in arr2 :
        val = d.get(j,0)
        if val > 0 :
            ans.append(j)
            return ans 
    return ans 
for _ in range(int(input())):
    n,k = map(int,input().split())
    arr1 = [int(x) for x in input().split()]
    arr2 = [int(x) for x in input().split()]
    ans = solution(arr1,arr2)
    if len(ans) == 0 :
        print('NO')
    else:
        print('YES')
        print(len(ans),end=' ')
        print(*ans)

    