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 codeforces;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class CommonSubsequence {

    public static void main(String []args) {

        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        while ( n > 0) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            HashSet<Integer> set = new HashSet<>();

            while (a > 0) {
                int x = sc.nextInt();
                set.add(x);
                a--;
            }
            boolean flag = false;
            while (b > 0) {
                int x = sc.nextInt();
                if(set.contains(x) && flag == false) {
                    System.out.println("YES");
                    System.out.println(1 + " " + x);
                    flag = true;
                    //break;
                }
                b--;
            }
            if(flag == false) {
                System.out.println("NO");
            }
            n--;
        }
    }
}
