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;
public class Main {
	public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	int c = sc.nextInt();
	Set<Integer> set = new HashSet<Integer>();
	while(c -->0) {
		boolean bol = false;
		int res=0;
		int a=sc.nextInt() , b=sc.nextInt();
		for(int i=0;i<a;i++) {
			set.add(sc.nextInt());
		}
		for(int i=0;i<b;i++) {
			 int x = sc.nextInt();
			if(set.contains(x)) {
           bol=true ;
           res=x;
           break;
			}
		}
		if(bol) {
			System.out.println("YES");
			System.out.println(1+" "+res);
		}else {
			System.out.println("NO");}
	}
	}
}
