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

/*package com.company.tests.number658;*/

import com.sun.security.jgss.GSSUtil;

import java.util.*;

public class Main {
    public static Scanner key = new Scanner(System.in);

    public static void solveA(int t) {
        while (t > 0) {
            t--;
            int n = key.nextInt();
            int m = key.nextInt();
            int[] a = new int[n];
            int[] b = new int[m];
            HashSet<Integer> set = new HashSet<Integer>();
            for (int i = 0; i < n; i++) {
                a[i] = key.nextInt();
                set.add(a[i]);
            }
            String ans = "NO";
            int common = -1;
            for (int i = 0; i < m; i++) {
                b[i] = key.nextInt();
                if(set.contains(b[i]) && common == -1) {
                    ans = "YES";
                    common = b[i];
                }
            }
            if(ans.equals("YES")) {
                System.out.println("YES");
                System.out.println("1 " + common);
            }
            else
                System.out.println("NO");
        }
    }


    public static void main(String[] args) {
        int t = key.nextInt();
        solveA(t);
    }
}
