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.*;

public class CF_658_A {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner s = new Scanner(System.in);
		int T = s.nextInt();
		while(T>0)
		{
			int n = s.nextInt();
			int m = s.nextInt();
			
			int arr1[] = new int[n];
			HashSet<Integer> hset = new HashSet<>();
			for(int i = 0;i<arr1.length;++i)
			{
				arr1[i] = s.nextInt();
				hset.add(arr1[i]);
			}
//			System.out.println(hset);
			int f = -1;
			int arr2[] = new int[m];
			for(int i = 0;i<arr2.length;++i)
			{
				arr2[i] = s.nextInt();
//				System.out.print(arr2[i] + " ");
				if(hset.contains(arr2[i]))
				{
//					System.out.print("hello");
					f = i;
				}
			}
			if(f == -1)
				System.out.println("NO");
			else
			{
				System.out.println("YES");
				System.out.println(1 + " " + arr2[f]);
			}
			T--;
		}
	}

}
