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

#Codeforces - - 1382 A Common Subsequence
t = int(input())
while t != 0:
    n, m = map(int,input().split())
    arrA = sorted(list(input().split()))
    arrB = sorted(list(input().split()))
    result = 0
    resultIndex = -1
    for i in range(len(arrA)):
        for j in range(i, len(arrB)):
            if arrA[i] == arrB[j]:
                result = 1
                resultIndex = i
                break
    if result == 0:
        print('NO')
    else:
        print('YES')
        print('1 {0}'.format(arrA[resultIndex]))
    t -= 1
