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;

public class codeforces {
	static int count[];

	public static void main(String[] args) {
		Scanner scn = new Scanner(System.in);
		int t = scn.nextInt();
		StringBuilder sb = new StringBuilder();
		while (t-- > 0) {
			count=new int[1002];
			int n=scn.nextInt();
			int m=scn.nextInt();
			int a[]=new int[n];
			for(int i=0;i<n;i++){
				a[i]=scn.nextInt();
				if(count[a[i]]==0){
					count[a[i]]++;
				}
			}
			int b[]=new int[m];
			for(int i=0;i<m;i++){
				b[i]=scn.nextInt();
				count[b[i]]++;
			}
			boolean ok=false;
			int ans=-1;
			for(int i=0;i<count.length;i++){
				if(count[i]>1){
					ans=i;
					ok=true;
					break;
				}
			}
			if(ok){
				sb.append("YES"+"\n");
				sb.append("1 "+ans+"\n");
			}
			else{
				sb.append("NO"+"\n");
			}

		}
		System.out.println(sb);

	}

}
