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 __future__ import division #, print_function
import string
import bisect
import copy
from fractions import gcd
INF = float('inf')
from decimal import *
from collections import deque
from sys import *
#setrecursionlimit(10**9+7)
from  math import pow
import random
MOD = 10 ** 9 + 7
for _ in xrange(input()):
    n, m = map(int, raw_input().split())
    l = map(int, raw_input().split())
    b = set(map(int, raw_input().split()))
    ans=next((a for a in l if a in b), None)
    if ans!=None:
        print "YES"
        print "1 ",ans
    else:
        print "NO"