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 java.util.*;
import java.io.*;
public class Solution{
    public static void main(String arg[]){
        Scanner scan = new Scanner(System.in);
        int t = scan.nextInt();
        while (t > 0)
        {
		    int i, j, k = 0, n = scan.nextInt(), m = scan.nextInt();
			int [] arr = new int[1001];
			for (i = 0; i < n; ++i)
			{
			j = scan.nextInt();
			arr[j]++;
			}
			for (i = 0; i < m; ++i)
			{
			j = scan.nextInt();
			if (arr[j] > 0)
			{
			k = Math.max(k, j);
			}
			}
			if (k == 0)
			{
			System.out.println("NO");
			}
			else
			{
			System.out.println("YES");
			System.out.println("1 " + k);
			}
            t--;
        }
    }
}