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

    public static void main(String[] args) {
        int t;
        Scanner sc = new Scanner(System.in);
        t = sc.nextInt();
        while (t > 0) {
            int n;
            int m;
            n  = sc.nextInt();
            m = sc.nextInt();
            Map<Integer, Boolean> map = new HashMap<>();
            for (int i = 0; i < n; i++) {
                int temp = sc.nextInt();
                map.put(temp, true);
            }
            int ans = 0;
            List<Integer> res = new ArrayList<>();
            for (int i = 0; i < m; i++) {
                int temp = sc.nextInt();
                if (map.containsKey(temp)) {
                    ans++;
                    res.add(temp);
                    break;
                }
            }

            if (ans == 0) {
                System.out.println("NO");
            } else {
                System.out.println("YES");
                System.out.print(ans + " ");
                for (int i = 0; i < res.size(); i++) {
                    System.out.print(res.get(i));
                }
                System.out.println();
            }
            t--;
        }
    }
}
