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

	public static void main(String[] args) {
		Scanner sc =new Scanner(System.in);
		int a =sc.nextInt();
		for(int j=0;j<a;j++)
				{
			int b=sc.nextInt();
			int c=sc.nextInt();
			int []d=new int[b];
			int []e=new int[c];
			for(int i=0;i<b;i++) {
				d[i]=sc.nextInt();
			}for(int i=0;i<c;i++) {
				e[i]=sc.nextInt();
			}
			int l=0;for(int i=0;i<b;i++) {
				for(int k=0;k<c;k++) {
					if(e[k] ==d[i]) {
						l=e[k];
						break;
					}
				}
				
			}if(l !=0) {
				System.out.println("YES"+" ");
				System.out.println("1"+" "+l);
				
			}
			else {
				System.out.print("NO");
			}
			
				}

	}

}
