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

import math
from sys import stdin
from collections import Counter,defaultdict,deque
mod=pow(10,9)+7
input=stdin.readline
def int1():
    return int(input())
def map1():
    return map(int,input().split())
def list1():
    return list(map(int,input().split()))
def solve():
    n,m=map1()
    l1=list1()
    l2=list1()
    l1=set(l1)
    l2=set(l2)
    l3=list(l1&l2)
    if(len(l3)!=0):
        print("YES")
        print(1,l3[0])
    else:
        print("NO")
    
for _ in range(int(input())):
    solve()