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 gcd(lft, rght):
#     if lft < rght:
#         rght, lft = lft, rght
#     if rght == 0:
#         return lft
#     return gcd(rght, lft % rght)
#
#
# def lcm(lft, rght):
#     return (lft * rght) / gcd(lft, rght)
from collections import defaultdict

inputs_cnt = int(input())

tree = defaultdict(set)

for input_index in range(inputs_cnt):
    a_len, b_len = map(int, input().split())
    a = set(input().split())
    b = set(input().split())

    intersection = list(a & b)
    if intersection:
        print('YES')
        print(1, intersection[0])
    else:
        print('NO')
