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 math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf
import math
def sp(): return map(int, input().split())
def fun(x):
    return sum(int(i) for i in str(x))
t=int(input())
# t=1
for _ in range(t):
    n,m=sp()
    a=list(sp())
    b=list(sp())
    for x in range(n):
        if a[x] in b:
            print("YES")
            print(1,a[x]);break;
        if(x==n-1):print("NO")
