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 Solution{
	public static void main(String[] args) {
		
		Scanner input =new Scanner(System.in);
		int t =input.nextInt();
		while(t-->0){
			int n = input.nextInt();
			int m = input.nextInt();
			
			Set<Integer> set =new HashSet<>();
			
			for(int i=0;i<n;i++){
				set.add(input.nextInt());
			}
			boolean flag =false; 
			for(int i=0;i<m;i++){
			    int temp =input.nextInt() ;
				if(set.contains(temp)){
				    System.out.println("YES");
				    System.out.printf("%d ", 1);
				    System.out.printf("%d ", temp);
				    System.out.println();
				    flag =true;
				    break ;
				}
			}
			if(!flag){
			    System.out.println("NO");
			}
		}
	}
}