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


t = int(input())

while t > 0:
	n1, n2 = input().split()
	n1 = int(n1)
	n2 = int(n2)

	lis1 = [int(a) for a in input().split()]
	lis2 = [int(a) for a in input().split()]

	lis1.sort()
	lis2.sort()

	ins = []

	i = 0
	j = 0

	while i<n1 and j<n2:
		if lis1[i] == lis2[j]:
			ins.append(lis1[i])
			i += 1
			j += 1
		elif lis1[i] < lis2[j]: i+=1
		else: j+=1

	if len(ins) == 0:
		print('NO')
	else:
		print('YES')
		print(len(ins), ins[0])

	t -= 1
