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 scc {

	public static void main(String args[]) {
		Scanner s = new Scanner(System.in);
		int tc = s.nextInt();
		for (int t = 1; t <= tc; t++) {
			int n = s.nextInt();
			int m = s.nextInt();
			int[] a1 = new int[n];
			int[] a2 = new int[m];

			for (int i = 0; i < a1.length; i++) {
				a1[i] = s.nextInt();
			}
			for (int j = 0; j < a2.length; j++) {
				a2[j] = s.nextInt();
			}
			
			int ans = calc(a1, a2);
			if(ans==Integer.MAX_VALUE) {
				System.out.println("NO");
			}else {
				System.out.println("YES");
				System.out.println(ans+" "+1);
			}

		}

	}

	public static int calc(int[] a1, int[] a2) {
		int ans = Integer.MAX_VALUE;

		for (int i = 0; i < a1.length; i++) {
			for (int j = 0; j < a2.length; j++) {
				if (a1[i] == a2[j] && ans > a1[i]) {
					ans = a1[i];
				}
			}
		}

		return ans;
	}
}