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.HashSet;
import java.util.Scanner;

public class problemA {    
    public static void main (String[] args)  
    { 
        Scanner scan=new Scanner(System.in);
        
         long t=scan.nextLong();
                            
                        while(t>0){
			 
                         int n=scan.nextInt();
                         
                         int m=scan.nextInt();
                         
                         int[] array1=new int[n];
                         HashSet<Integer> set=new HashSet<Integer>();
                         int [] array2=new int[m];
                         int out=0;
                         for(int i=0;i<array1.length;i++){
                             int number=scan.nextInt();
                             array1[i]=number;
                             set.add(number);
                         }
                         for(int i=0;i<array2.length;i++){
                             int number=scan.nextInt();
                             if(set.contains(number))
                             {
                                 out=number;
                                 break;
                             }
                         }
                         
                         if(out!=0){
                             System.out.println("YES");
                             System.out.println(1+" "+out);
                         }
                         else{
                             System.out.println("NO");
                         }

                         
                         
                        t--;
		}
          
    } 
                
         }      
