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 CommonSubsequence1382A {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		
		
		for (int i = 0; i < n; i++) {
			int a1 = in.nextInt();
			int a2 = in.nextInt();
			
			int[] n1 = new int[a1];
			int[] n2 = new int[a2];
			for (int j = 0; j < a1; j++) {
				n1[j] = in.nextInt();
			}
			boolean ok = false;
			for (int j2 = 0; j2 < a2; j2++) {
				int a= in.nextInt();
				for (int j = 0; j < a1; j++) {
					if (n1[j] == a) {
						if (!ok)
						System.out.println("YES");
						System.out.println("1 "+ a);
						ok = true;
						break;
					}
				}
				
			}	
			if (!ok) {
				System.out.println("NO");
			}

			
		}
			
	}
}