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 Main{
    public static void main(String[] args){
        Scanner s = new Scanner(System.in);
        int t = s.nextInt();
        while(t-->0){
           int n = s.nextInt();
           int m = s.nextInt();
           boolean found = false;
           int l =0;
           int element = 0;
           
          Set<Integer> map = new HashSet<Integer>();
           
           for(int i=0 ; i<n; i++){
               int k = s.nextInt();
               map.add(k);
           }
           
           for(int i=0 ; i<m; i++){
               int k = s.nextInt();
               if(map.contains(k)){
                   l=1;
                   found = true;
                   element = k;
               }
           }
           if(found){
               System.out.println("YES");
           
           System.out.println(l+" "+element);
           }else
           System.out.println("NO");
        }
    }
}