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 sc = new Scanner(System.in);
        int t = sc.nextInt();
        while(t-- > 0){
            int n1 = sc.nextInt();
            int n2 = sc.nextInt();
            HashSet<Integer> set = new HashSet<Integer>();
            for(int i = 0 ; i < n1 ; i++){
                int x = sc.nextInt();
                set.add(x);
            }
            Boolean flag = false;
            for(int i = 0 ; i < n2 ; i++){
                int x = sc.nextInt();
                if(set.contains(x)&& (!flag)){
                    System.out.println("YES");
                    System.out.println("1 "+x);
                    flag = true;
                }
            }
            if(!flag)
                System.out.println("NO");
        }
    }
}