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

#!/usr/local/bin/python3
def fast(n,m,A,B):
    for num in set(A).intersection(set(B)):
        return [num]
    return []
def main():
    t = int(input())
    for _ in range(t):
        n,m = [int(x) for x in input().split()]
        A = [int(x) for x in input().split()]
        B = [int(x) for x in input().split()]
        result = fast(n,m,A,B)
        if len(result) == 0:
            print('NO')
        else:
            print('YES')
            print(f'1 {result[0]}')
main()
        