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 A {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        for(int i=0; i<t; i++) {
           solve(sc);
        }
    }

    static void solve(Scanner sc) {
        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] a = new int[1001];
        int[] b = new int[1001];

        for(int i=0; i<n; i++) {
            int num = sc.nextInt();
            a[num]++;
        }
        for(int i=0; i<m; i++) {
            int num = sc.nextInt();
            b[num]++;
        }
        for(int i=1; i<=1000; i++) {
            if(a[i]>0 && b[i]>0) {
                System.out.println("YES");
                System.out.println("1 " + i);
                return;
            }
        }
        System.out.println("NO");

    }

}