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.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * @author Carry
 * @date 2020/11/15
 */
public class Main {
    
    public static void main(String[] args) {
        final StringBuilder buffer = new StringBuilder();
        
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        while (n-- > 0) {
            Set<Integer> set = new HashSet<>();
            int m = sc.nextInt();
            int m2 = sc.nextInt();
            while (m-- > 0) {
                set.add(sc.nextInt());
            }
            m = m2;
            boolean succ = false;
            while (m-- > 0) {
                int num = sc.nextInt();
                if (!succ && set.contains(num)) {
                    System.out.println("YES");
                    System.out.println("1" + " " + num);
                    succ = true;
                }
                set.add(num);
            }
            if (!succ) {
                System.out.println("NO");
            }
        }
    }
    
    private static char nextLower(char lower) {
        lower++;
        if (lower > 'z') {
            lower = 'a';
        }
        return lower;
    }
    
}
