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

    private static final Scanner sc = new Scanner(System.in);
    private static String s;
    private static int[] arr;
    private static HashSet<Integer> set;
    private static HashMap<Integer, Integer> map;
    private static Stack<Integer> stk;




    public static void foo(int k){

        int n = sc.nextInt();
        int m = sc.nextInt();
        set = new HashSet<>();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            set.add(sc.nextInt());
        }
        int x = 0, ans = -1, ind = -1;
        for (int i = 0; i < m; i++) {
            x = sc.nextInt();
            if (set.contains(x)) {
                ind = i;
                ans = x;
            }
        }
        if (ind != -1) {
            System.out.println("YES");
            System.out.println("1 " + ans);
        }


    }


    public static void main(String[] args) {

        int t = sc.nextInt();
        for (int i = 0; i < t; i++) {
            foo(i);
        }
    }
}