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 cpsolve {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int T = in.nextInt();
        for (int t = 0; t < T; t++) {
            int n=in.nextInt();
            int m=in.nextInt();
            int a[]=new int[n];
            for(int i=0;i<n;i++){
                a[i]=in.nextInt();
            }
            int b[]=new int[m];
            for(int i=0;i<m;i++){
                b[i]=in.nextInt();
            }
            boolean d=false;
            for(int i=0;i<n;i++){
                for(int j=0;j<m;j++){
                    if(a[i]==a[j]){
                        System.out.println("YES");
                        System.out.println(1+" "+a[j]);
                        d=true;
                        break;
                    }
                }
            }
            if(!d){
                System.out.println("NO");
            }
        }

    }
}
