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 AC{
	public static void main(String args[]){
		Scanner in = new Scanner(System.in);
		int t = in.nextInt();
		for(int x = 0; x < t; x++){
			int n = in.nextInt();
			int m = in.nextInt();

			int ar[] = new int[n];
			int br[] = new int[m];

			
			for(int i = 0 ; i < n ; i++)	ar[i] = in.nextInt();
			for(int j = 0 ; j < m ; j++)	br[j] = in.nextInt();
			boolean found = false;
			for(int i =0 ; i <n ; i++){
				for(int j = 0; j < m ; j++){
					if(ar[i] == ar[j]){
						System.out.println("YES");
						System.out.print(1+" "+ar[i]+"\n");
						found = true;
						i = n;
						break;
					}
				}
			}

			if(found == true)
				continue;

			
			

			if(found == false)
				System.out.println("NO");

		}
	}
}