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 ques1 {


    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        for (int t = 0; t < T; t++) {
            int N = sc.nextInt();
            HashSet<Integer> hs = new HashSet<>();
            int M = sc.nextInt();
            int[] A = new int[N];
            int[] B = new int[M];
            for (int i = 0; i < N; i++) A[i] = sc.nextInt();
            for (int j = 0; j < M; j++) B[j] = sc.nextInt();

            for (int u = 0; u < N; u++) {
                hs.add(A[u]);
            }
            int flag=0;
            for (int h = 0; h < M; h++) {
                if (hs.contains(B[h])) {
                    System.out.println("YES");
                    System.out.println(B[h]);
                    flag=1;
                    break;
                }
            }
            if(flag==0){
                System.out.println("NO");
            }
        }
    }
}