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

    public static void main(String[] args){
        Scanner s = new Scanner(System.in);
        int t = s.nextInt();
        for (int i = 0; i < t; i++){
            solve(s);
        }
    }

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

        int a[] = new int[n];
        int b[] = new int[m];
        for (int i = 0; i < n; i++){
            a[i] = s.nextInt();
        }
        for (int i = 0; i < m; i++){
            b[i] = s.nextInt();
        }

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

}