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.Scanner;

public class CommonSubsequence {

    public static void main(String args[]) {
        Scanner scan = new Scanner(System.in);
        int t = scan.nextInt();
        while (t-- > 0) {
            int n = scan.nextInt();
            int m = scan.nextInt();
            int res = -1;
            int[] a = new int[100000];
            for (int i = 0; i < n; i++) {
                ++a[scan.nextInt()];
            }
            for (int i = 0; i < m; i++) {
                int k = scan.nextInt();
                if (a[k] != 0) {
                    res = k;
                }
            }
            if (res == -1) {
                System.out.println("NO");
            } else {
                System.out.println("YES");
                System.out.println(1 + " " + res);

            }
        }
    }
}
