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 cf1382A {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        for(int j=0; j<t; j++) {
            int n = sc.nextInt();
            int a[] = new int[n];
            int m = sc.nextInt();
            int b[] = new int[m];
            int pos[] = new int[1001]; //to track
            boolean found = false;
            int s = 0; //first num in subsequence
            for(int i=0; i<n; i++) {
                a[i] = sc.nextInt();
                pos[a[i]]++;
            }

            for(int i=0; i<m; i++) {
                b[i] = sc.nextInt();
                if(pos[b[i]] > 0) {
                    found = true;
                    s = b[i];
                    break;
                }
            }

            if(found) {
                System.out.println("YES");
                System.out.println(1 + " " + s);
            }
            else
                System.out.println("NO");
        }
        sc.close();
    }
}