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 p1382A {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		while (t-- > 0) {
			int n = sc.nextInt(), m = sc.nextInt(), c = 0;
			int a[] = new int[n];
			int b[] = new int[m];
			int d[] = new int[n];
			for (int i = 0; i < n; i++) {
				a[i] = sc.nextInt();
			}
			for (int i = 0; i < m; i++) {
				b[i] = sc.nextInt();
				for (int j = 0; j < n; j++) {
					if (b[i] == a[j]) {
						d[c] = b[i];
						c++;
					}
				}
			}
			if (c == 0)
				System.out.println("NO");
			else {
				System.out.print("YES\n"+c+ " ");

				for (int i = 0; i < c - 1; i++) {

					System.out.print(d[i]+" ");
				}
				System.out.println(d[c - 1]);
			}
		}
	}
}
