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.*;

public class Solution {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
		StringBuilder result = new StringBuilder();
		int t = scan.nextInt();
		for(int i = 0; i < t; i++) {
			int n = scan.nextInt();
			int m = scan.nextInt();
			Set<Integer> an = new HashSet<Integer>();
			for(int j = 0; j < n; j++) {
				an.add(scan.nextInt());
			}
			int res = 0;
			for(int j = 0; j < m; j++) {
				int nextInt = scan.nextInt();
				if(!an.add(nextInt)) {
					res = nextInt;
				}
			}
			String answer = (res != 0) ? "YES\n1 " + res : "NO";
			result.append(answer + "\n");
		}
		System.out.println(result);
    }	
}