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

from collections import deque
from math import *
import heapq

t=int(input())
for i in range(t):
    n,m=list(map(int,input().split()))
    l1=list(map(int,input().split()))
    l2=list(map(int,input().split()))

    d={}
    for j in range(len(l1)):
        d[l1[j]]=1
    beta=False
    for j in range(len(l2)):
        if l2[j] in d:
            print("YES")
            print(1,l2[j])
            beta=True
            break
    if beta==False:
        print("NO")
    
    

